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_find_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:48:08,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:48:08,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:48:08,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:48:08,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:48:08,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:48:08,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:48:08,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:48:08,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:48:08,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:48:08,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:48:08,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:48:08,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:48:08,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:48:08,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:48:08,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:48:08,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:48:08,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:48:08,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:48:08,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:48:08,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:48:08,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:48:08,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:48:08,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:48:08,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:48:08,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:48:08,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:48:08,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:48:08,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:48:08,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:48:08,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:48:08,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:48:08,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:48:08,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:48:08,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:48:08,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:48:08,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:48:08,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:48:08,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:48:08,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:48:08,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:48:08,653 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-06 23:48:08,669 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:48:08,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:48:08,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:48:08,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:48:08,671 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:48:08,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:48:08,671 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:48:08,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:48:08,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:48:08,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:48:08,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:48:08,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:48:08,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:48:08,672 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:48:08,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:48:08,673 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:48:08,673 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:48:08,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:48:08,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:48:08,673 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:48:08,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:48:08,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:48:08,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:48:08,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:48:08,674 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:48:08,675 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:48:08,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:48:08,675 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:48:08,675 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-06 23:48:08,964 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:48:08,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:48:08,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:48:08,989 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:48:08,990 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:48:08,990 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_find_ground-1.i [2019-10-06 23:48:09,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9343b9bc0/42666c969f0f453289a6a5ca38265115/FLAG3c568933d [2019-10-06 23:48:09,532 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:48:09,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_find_ground-1.i [2019-10-06 23:48:09,541 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9343b9bc0/42666c969f0f453289a6a5ca38265115/FLAG3c568933d [2019-10-06 23:48:09,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9343b9bc0/42666c969f0f453289a6a5ca38265115 [2019-10-06 23:48:09,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:48:09,955 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:48:09,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:48:09,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:48:09,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:48:09,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:48:09" (1/1) ... [2019-10-06 23:48:09,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47fbaaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:48:09, skipping insertion in model container [2019-10-06 23:48:09,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:48:09" (1/1) ... [2019-10-06 23:48:09,977 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:48:10,003 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:48:10,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:48:10,296 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:48:10,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:48:10,351 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:48:10,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:48:10 WrapperNode [2019-10-06 23:48:10,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:48:10,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:48:10,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:48:10,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:48:10,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:48:10" (1/1) ... [2019-10-06 23:48:10,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:48:10" (1/1) ... [2019-10-06 23:48:10,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:48:10" (1/1) ... [2019-10-06 23:48:10,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:48:10" (1/1) ... [2019-10-06 23:48:10,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:48:10" (1/1) ... [2019-10-06 23:48:10,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:48:10" (1/1) ... [2019-10-06 23:48:10,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:48:10" (1/1) ... [2019-10-06 23:48:10,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:48:10,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:48:10,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:48:10,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:48:10,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:48:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:48:10,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:48:10,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:48:10,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:48:10,579 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:48:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:48:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:48:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:48:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:48:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:48:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:48:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:48:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:48:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:48:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:48:10,954 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:48:10,954 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-06 23:48:10,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:48:10 BoogieIcfgContainer [2019-10-06 23:48:10,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:48:10,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:48:10,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:48:10,960 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:48:10,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:48:09" (1/3) ... [2019-10-06 23:48:10,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3855f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:48:10, skipping insertion in model container [2019-10-06 23:48:10,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:48:10" (2/3) ... [2019-10-06 23:48:10,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3855f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:48:10, skipping insertion in model container [2019-10-06 23:48:10,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:48:10" (3/3) ... [2019-10-06 23:48:10,964 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_find_ground-1.i [2019-10-06 23:48:10,975 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:48:10,988 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:48:11,001 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:48:11,037 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:48:11,037 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:48:11,037 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:48:11,037 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:48:11,038 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:48:11,038 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:48:11,038 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:48:11,038 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:48:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-06 23:48:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:48:11,063 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:48:11,064 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:48:11,067 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:48:11,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:48:11,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1508760786, now seen corresponding path program 1 times [2019-10-06 23:48:11,084 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:48:11,084 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:11,085 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:11,085 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:11,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:48:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:48:11,215 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:11,216 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:48:11,217 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-06 23:48:11,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-06 23:48:11,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-06 23:48:11,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-06 23:48:11,233 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-10-06 23:48:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:48:11,256 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-10-06 23:48:11,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-06 23:48:11,258 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-06 23:48:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:48:11,266 INFO L225 Difference]: With dead ends: 34 [2019-10-06 23:48:11,267 INFO L226 Difference]: Without dead ends: 18 [2019-10-06 23:48:11,271 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-06 23:48:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-06 23:48:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-06 23:48:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-06 23:48:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-06 23:48:11,320 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-06 23:48:11,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:48:11,320 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-06 23:48:11,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-06 23:48:11,321 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-06 23:48:11,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:48:11,322 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:48:11,322 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:48:11,322 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:48:11,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:48:11,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1117724220, now seen corresponding path program 1 times [2019-10-06 23:48:11,323 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:48:11,323 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:11,324 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:11,324 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:11,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:48:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:48:11,393 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:11,393 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:48:11,393 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:48:11,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:48:11,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:48:11,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:48:11,396 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2019-10-06 23:48:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:48:11,411 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-10-06 23:48:11,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:48:11,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-06 23:48:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:48:11,413 INFO L225 Difference]: With dead ends: 31 [2019-10-06 23:48:11,413 INFO L226 Difference]: Without dead ends: 19 [2019-10-06 23:48:11,414 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:48:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-06 23:48:11,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-06 23:48:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-06 23:48:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-06 23:48:11,421 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-10-06 23:48:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:48:11,421 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-06 23:48:11,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:48:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-06 23:48:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-06 23:48:11,422 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:48:11,422 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:48:11,423 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:48:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:48:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash -578316820, now seen corresponding path program 1 times [2019-10-06 23:48:11,424 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:48:11,424 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:11,424 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:11,424 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:11,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:48:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:48:11,520 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:11,520 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:48:11,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:11,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:48:11,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:48:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:48:11,644 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:48:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:48:11,698 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:48:11,722 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:48:11,722 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:48:11,730 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:48:11,737 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:48:11,738 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:48:11,908 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:48:12,240 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:48:12,268 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:48:12,276 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:48:12,277 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:48:12,297 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 81#(<= 100000 main_~j~0) [2019-10-06 23:48:12,297 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 111#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:12,297 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 120#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:48:12,298 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 116#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:12,298 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 91#(and (or (and (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= main_~i~0 100000) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0))) (or (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (not (< main_~i~0 100000))))) [2019-10-06 23:48:12,298 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 106#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:48:12,299 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:12,299 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:12,299 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 125#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:12,300 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:48:12,300 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:48:12,300 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 96#(and (or (and (<= 0 main_~i~0) (<= main_~i~0 100000) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0))) (or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (not (< main_~j~0 100000)) (= main_~x~0 0) (not (< main_~i~0 100000)) (< main_~x~0 main_~i~0)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (not (< main_~j~0 100000)) (= main_~x~0 0) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (< main_~x~0 main_~i~0)))) [2019-10-06 23:48:12,301 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 86#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:48:12,301 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 101#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:48:12,301 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 73#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:48:12,851 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:48:12,851 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 12] total 18 [2019-10-06 23:48:12,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:48:12,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:48:12,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:48:12,856 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 18 states. [2019-10-06 23:48:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:48:13,520 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-10-06 23:48:13,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-06 23:48:13,521 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-10-06 23:48:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:48:13,524 INFO L225 Difference]: With dead ends: 37 [2019-10-06 23:48:13,524 INFO L226 Difference]: Without dead ends: 25 [2019-10-06 23:48:13,526 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2019-10-06 23:48:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-06 23:48:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-10-06 23:48:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-06 23:48:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-06 23:48:13,539 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-10-06 23:48:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:48:13,540 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-06 23:48:13,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:48:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-06 23:48:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-06 23:48:13,542 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:48:13,543 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:48:13,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:13,755 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:48:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:48:13,756 INFO L82 PathProgramCache]: Analyzing trace with hash -187200964, now seen corresponding path program 2 times [2019-10-06 23:48:13,756 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:48:13,756 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:13,756 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:13,757 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:13,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:48:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:48:13,866 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:13,866 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:48:13,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:13,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-10-06 23:48:13,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:48:13,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:48:13,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:48:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:48:13,956 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:48:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:48:13,985 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-06 23:48:13,985 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 10 [2019-10-06 23:48:13,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-06 23:48:13,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-06 23:48:13,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-06 23:48:13,987 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-10-06 23:48:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:48:14,013 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-10-06 23:48:14,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:48:14,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-06 23:48:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:48:14,014 INFO L225 Difference]: With dead ends: 35 [2019-10-06 23:48:14,014 INFO L226 Difference]: Without dead ends: 24 [2019-10-06 23:48:14,015 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-06 23:48:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-06 23:48:14,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-06 23:48:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-06 23:48:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-06 23:48:14,022 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2019-10-06 23:48:14,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:48:14,022 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-06 23:48:14,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-06 23:48:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-06 23:48:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-06 23:48:14,023 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:48:14,023 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:48:14,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:14,235 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:48:14,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:48:14,235 INFO L82 PathProgramCache]: Analyzing trace with hash -884454193, now seen corresponding path program 1 times [2019-10-06 23:48:14,236 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:48:14,236 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:14,236 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:14,236 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:14,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:48:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:48:14,321 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:14,321 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:48:14,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:14,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:48:14,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:48:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:48:14,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:48:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:48:14,452 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:48:14,455 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:48:14,456 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:48:14,456 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:48:14,456 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:48:14,457 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:48:14,500 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:48:14,624 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 24 for LOIs [2019-10-06 23:48:14,635 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:48:14,641 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:48:14,641 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:48:14,641 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:48:14,642 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 121#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1) (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~i~0_BEFORE_CALL_2) (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_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2))))) (< v_main_~i~0_BEFORE_CALL_2 100000)) (and (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~i~0_BEFORE_CALL_2) (= (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_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2)))) (< v_main_~i~0_BEFORE_CALL_2 100000)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:48:14,642 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 130#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:48:14,642 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 126#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1) (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~i~0_BEFORE_CALL_2) (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_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2))))) (< v_main_~i~0_BEFORE_CALL_2 100000)) (and (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~i~0_BEFORE_CALL_2) (= (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_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2)))) (< v_main_~i~0_BEFORE_CALL_2 100000)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:48:14,643 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 101#(and (or (and (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= main_~i~0 100000) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0))) (or (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (not (< main_~i~0 100000))))) [2019-10-06 23:48:14,643 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 116#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1) (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~i~0_BEFORE_CALL_2) (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_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2))))) (< v_main_~i~0_BEFORE_CALL_2 100000)) (and (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~i~0_BEFORE_CALL_2) (= (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_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2)))) (< v_main_~i~0_BEFORE_CALL_2 100000)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:48:14,643 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:14,643 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:14,644 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 135#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:14,644 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:48:14,644 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:48:14,644 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 106#(and (or (and (<= 0 main_~i~0) (<= main_~i~0 100000) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0))) (or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (not (< main_~j~0 100000)) (= main_~x~0 0) (not (< main_~i~0 100000)) (< main_~x~0 main_~i~0)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (not (< main_~j~0 100000)) (= main_~x~0 0) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (< main_~x~0 main_~i~0)))) [2019-10-06 23:48:14,645 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:48:14,645 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 111#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1) (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~i~0_BEFORE_CALL_2) (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_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2))))) (< v_main_~i~0_BEFORE_CALL_2 100000)) (and (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~i~0_BEFORE_CALL_2) (= (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_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* 4 v_main_~i~0_BEFORE_CALL_2)))) (< v_main_~i~0_BEFORE_CALL_2 100000)))) [2019-10-06 23:48:14,645 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:48:15,115 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:48:15,116 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 12] total 24 [2019-10-06 23:48:15,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-06 23:48:15,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-06 23:48:15,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2019-10-06 23:48:15,120 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 24 states. [2019-10-06 23:48:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:48:15,916 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-10-06 23:48:15,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-06 23:48:15,917 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 20 [2019-10-06 23:48:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:48:15,918 INFO L225 Difference]: With dead ends: 47 [2019-10-06 23:48:15,918 INFO L226 Difference]: Without dead ends: 33 [2019-10-06 23:48:15,919 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=307, Invalid=1415, Unknown=0, NotChecked=0, Total=1722 [2019-10-06 23:48:15,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-06 23:48:15,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-10-06 23:48:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-06 23:48:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-06 23:48:15,928 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 20 [2019-10-06 23:48:15,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:48:15,928 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-06 23:48:15,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-06 23:48:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-10-06 23:48:15,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-06 23:48:15,930 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:48:15,930 INFO L385 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:48:16,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:16,134 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:48:16,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:48:16,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1143787825, now seen corresponding path program 2 times [2019-10-06 23:48:16,135 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:48:16,136 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:16,136 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:16,136 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:16,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:48:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:48:16,363 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:16,363 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:48:16,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:16,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:48:16,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:48:16,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-06 23:48:16,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:48:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-06 23:48:16,623 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:48:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-06 23:48:16,802 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:48:16,804 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:48:16,805 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:48:16,806 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:48:16,806 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:48:16,807 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:48:16,860 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:48:17,020 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:48:17,038 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:48:17,045 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:48:17,045 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:48:17,045 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:48:17,046 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 121#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:17,046 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 126#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:17,046 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 130#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:48:17,047 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 101#(and (or (and (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= main_~i~0 100000) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0))) (or (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (not (< main_~i~0 100000))))) [2019-10-06 23:48:17,047 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 116#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:48:17,047 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:17,048 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:17,048 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:48:17,048 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 135#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:17,048 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:48:17,049 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 106#(and (or (and (<= 0 main_~i~0) (<= main_~i~0 100000) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0))) (or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (not (< main_~j~0 100000)) (= main_~x~0 0) (not (< main_~i~0 100000)) (< main_~x~0 main_~i~0)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (not (< main_~j~0 100000)) (= main_~x~0 0) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (< main_~x~0 main_~i~0)))) [2019-10-06 23:48:17,049 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:48:17,049 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 111#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:48:17,051 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:48:17,705 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:48:17,706 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9, 12] total 37 [2019-10-06 23:48:17,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-06 23:48:17,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-06 23:48:17,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1182, Unknown=0, NotChecked=0, Total=1332 [2019-10-06 23:48:17,708 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 37 states. [2019-10-06 23:48:18,702 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-10-06 23:48:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:48:19,183 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-10-06 23:48:19,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-06 23:48:19,183 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 26 [2019-10-06 23:48:19,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:48:19,185 INFO L225 Difference]: With dead ends: 50 [2019-10-06 23:48:19,185 INFO L226 Difference]: Without dead ends: 36 [2019-10-06 23:48:19,187 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=479, Invalid=3303, Unknown=0, NotChecked=0, Total=3782 [2019-10-06 23:48:19,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-06 23:48:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-10-06 23:48:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-06 23:48:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-10-06 23:48:19,196 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 26 [2019-10-06 23:48:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:48:19,196 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-10-06 23:48:19,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-06 23:48:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-10-06 23:48:19,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-06 23:48:19,199 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:48:19,199 INFO L385 BasicCegarLoop]: trace histogram [11, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:48:19,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:19,407 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:48:19,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:48:19,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1461624573, now seen corresponding path program 1 times [2019-10-06 23:48:19,407 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:48:19,407 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:19,408 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:19,408 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:48:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-06 23:48:19,499 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:19,500 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:48:19,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:19,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-06 23:48:19,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:48:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:48:19,698 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:48:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:48:19,991 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:48:19,993 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:48:19,993 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:48:19,994 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:48:19,994 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:48:19,994 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:48:20,034 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:48:20,252 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:48:20,272 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:48:20,276 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:48:20,276 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:48:20,277 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:48:20,277 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:20,277 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:20,277 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:48:20,278 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:48:20,278 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:48:20,278 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-06 23:48:20,278 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:48:20,278 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:20,279 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:20,279 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:48:20,279 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:20,279 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:48:20,280 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:48:20,280 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:48:20,280 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:48:20,280 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:48:20,280 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:48:20,898 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:48:20,898 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 14, 14] total 43 [2019-10-06 23:48:20,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-06 23:48:20,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-06 23:48:20,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1430, Unknown=0, NotChecked=0, Total=1806 [2019-10-06 23:48:20,901 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 43 states. [2019-10-06 23:48:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:48:23,002 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2019-10-06 23:48:23,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-06 23:48:23,003 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 34 [2019-10-06 23:48:23,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:48:23,006 INFO L225 Difference]: With dead ends: 73 [2019-10-06 23:48:23,006 INFO L226 Difference]: Without dead ends: 50 [2019-10-06 23:48:23,011 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1274, Invalid=5866, Unknown=0, NotChecked=0, Total=7140 [2019-10-06 23:48:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-06 23:48:23,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-06 23:48:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-06 23:48:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-10-06 23:48:23,021 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 34 [2019-10-06 23:48:23,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:48:23,021 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-10-06 23:48:23,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-06 23:48:23,021 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-10-06 23:48:23,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-06 23:48:23,023 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:48:23,023 INFO L385 BasicCegarLoop]: trace histogram [24, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:48:23,234 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:23,235 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:48:23,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:48:23,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1225133434, now seen corresponding path program 2 times [2019-10-06 23:48:23,236 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:48:23,236 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:23,237 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:23,237 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:23,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:48:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 2 proven. 300 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-06 23:48:23,661 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:23,662 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:48:23,662 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:23,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:48:23,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:48:23,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-06 23:48:23,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:48:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-06 23:48:23,970 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:48:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-06 23:48:24,258 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:48:24,259 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:48:24,260 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:48:24,260 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:48:24,260 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:48:24,261 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:48:24,293 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:48:24,424 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:48:24,440 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:48:24,443 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:48:24,444 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:48:24,444 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:24,444 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:48:24,444 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:24,445 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:48:24,445 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:48:24,445 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:48:24,445 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-06 23:48:24,447 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:48:24,452 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:24,452 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:48:24,453 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:24,455 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:48:24,455 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:48:24,456 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:48:24,457 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:48:24,457 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:48:24,457 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:48:24,457 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:48:25,123 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:48:25,124 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11, 11, 14] total 57 [2019-10-06 23:48:25,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-06 23:48:25,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-06 23:48:25,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=2743, Unknown=0, NotChecked=0, Total=3192 [2019-10-06 23:48:25,127 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 57 states. [2019-10-06 23:48:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:48:28,702 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2019-10-06 23:48:28,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-06 23:48:28,703 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 49 [2019-10-06 23:48:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:48:28,704 INFO L225 Difference]: With dead ends: 77 [2019-10-06 23:48:28,705 INFO L226 Difference]: Without dead ends: 57 [2019-10-06 23:48:28,708 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2228 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1459, Invalid=8843, Unknown=0, NotChecked=0, Total=10302 [2019-10-06 23:48:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-06 23:48:28,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-10-06 23:48:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-06 23:48:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-06 23:48:28,718 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 49 [2019-10-06 23:48:28,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:48:28,719 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-06 23:48:28,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-06 23:48:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-06 23:48:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-06 23:48:28,720 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:48:28,721 INFO L385 BasicCegarLoop]: trace histogram [25, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:48:28,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:28,924 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:48:28,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:48:28,925 INFO L82 PathProgramCache]: Analyzing trace with hash 811420498, now seen corresponding path program 3 times [2019-10-06 23:48:28,925 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:48:28,926 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:28,926 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:28,926 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:28,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:48:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 4 proven. 325 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-06 23:48:29,333 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:29,333 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:48:29,333 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:29,444 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:48:29,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:48:29,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-06 23:48:29,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:48:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-10-06 23:48:29,558 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:48:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-10-06 23:48:29,666 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:48:29,667 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:48:29,668 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:48:29,668 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:48:29,668 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:48:29,668 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:48:29,688 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:48:29,836 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:48:29,855 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:48:29,858 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:48:29,859 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:48:29,859 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:29,859 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:48:29,860 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:29,860 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:48:29,860 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:48:29,861 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:48:29,861 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-06 23:48:29,861 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:48:29,861 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:29,862 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:29,862 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:29,862 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:48:29,862 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:48:29,862 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:48:29,862 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:48:29,863 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:48:29,863 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:48:29,863 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:48:30,433 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:48:30,433 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 8, 8, 14] total 50 [2019-10-06 23:48:30,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-06 23:48:30,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-06 23:48:30,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1995, Unknown=0, NotChecked=0, Total=2450 [2019-10-06 23:48:30,436 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 50 states. [2019-10-06 23:48:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:48:33,443 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2019-10-06 23:48:33,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-06 23:48:33,444 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 57 [2019-10-06 23:48:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:48:33,446 INFO L225 Difference]: With dead ends: 88 [2019-10-06 23:48:33,446 INFO L226 Difference]: Without dead ends: 57 [2019-10-06 23:48:33,450 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 148 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2245 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1575, Invalid=7931, Unknown=0, NotChecked=0, Total=9506 [2019-10-06 23:48:33,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-06 23:48:33,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-06 23:48:33,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-06 23:48:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-10-06 23:48:33,459 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 57 [2019-10-06 23:48:33,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:48:33,460 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-10-06 23:48:33,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-06 23:48:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-10-06 23:48:33,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-06 23:48:33,461 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:48:33,461 INFO L385 BasicCegarLoop]: trace histogram [26, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:48:33,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:33,666 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:48:33,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:48:33,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1618397557, now seen corresponding path program 4 times [2019-10-06 23:48:33,666 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:48:33,667 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:33,667 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:33,667 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:33,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:48:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 4 proven. 351 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-06 23:48:34,108 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:34,108 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:48:34,108 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:34,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-06 23:48:34,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:48:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-06 23:48:34,265 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:48:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 4 proven. 351 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-06 23:48:35,262 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:48:35,263 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:48:35,263 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:48:35,264 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:48:35,264 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:48:35,264 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:48:35,296 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:48:35,434 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:48:35,454 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:48:35,458 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:48:35,458 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:48:35,458 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:35,459 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:48:35,459 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:35,459 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:48:35,459 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:48:35,460 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:48:35,460 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-06 23:48:35,460 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:48:35,460 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:35,460 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:35,461 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:35,461 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:48:35,461 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:48:35,461 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:48:35,461 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:48:35,461 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:48:35,462 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:48:35,462 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:48:35,985 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:48:35,985 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29, 14] total 70 [2019-10-06 23:48:35,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-06 23:48:35,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-06 23:48:35,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1637, Invalid=3193, Unknown=0, NotChecked=0, Total=4830 [2019-10-06 23:48:35,990 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 70 states. [2019-10-06 23:48:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:48:39,254 INFO L93 Difference]: Finished difference Result 110 states and 145 transitions. [2019-10-06 23:48:39,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-06 23:48:39,254 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 60 [2019-10-06 23:48:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:48:39,256 INFO L225 Difference]: With dead ends: 110 [2019-10-06 23:48:39,256 INFO L226 Difference]: Without dead ends: 85 [2019-10-06 23:48:39,261 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4255 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4804, Invalid=13018, Unknown=0, NotChecked=0, Total=17822 [2019-10-06 23:48:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-06 23:48:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-10-06 23:48:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-06 23:48:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-10-06 23:48:39,273 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 60 [2019-10-06 23:48:39,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:48:39,273 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-10-06 23:48:39,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-06 23:48:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-10-06 23:48:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-06 23:48:39,275 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:48:39,275 INFO L385 BasicCegarLoop]: trace histogram [54, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:48:39,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:39,479 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:48:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:48:39,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1621671285, now seen corresponding path program 5 times [2019-10-06 23:48:39,480 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:48:39,480 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:39,481 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:39,481 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:39,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:48:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 4 proven. 1485 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-06 23:48:40,932 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:40,932 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:48:40,932 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:41,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:48:41,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:48:41,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-06 23:48:41,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:48:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 1489 trivial. 0 not checked. [2019-10-06 23:48:41,460 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:48:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 1489 trivial. 0 not checked. [2019-10-06 23:48:41,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:48:41,916 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:48:41,917 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:48:41,917 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:48:41,917 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:48:41,918 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:48:41,938 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:48:42,040 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:48:42,053 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:48:42,056 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:48:42,056 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:48:42,057 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:42,057 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:48:42,057 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:42,057 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:48:42,057 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:48:42,058 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:48:42,058 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-06 23:48:42,058 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:48:42,058 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:42,058 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:42,058 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:42,059 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:48:42,059 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:48:42,059 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:48:42,059 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:48:42,059 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:48:42,059 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:48:42,060 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:48:42,981 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:48:42,982 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 13, 13, 14] total 91 [2019-10-06 23:48:42,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-10-06 23:48:42,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-10-06 23:48:42,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1707, Invalid=6483, Unknown=0, NotChecked=0, Total=8190 [2019-10-06 23:48:42,984 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 91 states. [2019-10-06 23:48:49,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:48:49,939 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2019-10-06 23:48:49,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-06 23:48:49,939 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 88 [2019-10-06 23:48:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:48:49,941 INFO L225 Difference]: With dead ends: 117 [2019-10-06 23:48:49,942 INFO L226 Difference]: Without dead ends: 92 [2019-10-06 23:48:49,949 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5856 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=5356, Invalid=23374, Unknown=0, NotChecked=0, Total=28730 [2019-10-06 23:48:49,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-06 23:48:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2019-10-06 23:48:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-06 23:48:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2019-10-06 23:48:49,962 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 88 [2019-10-06 23:48:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:48:49,962 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2019-10-06 23:48:49,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-10-06 23:48:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2019-10-06 23:48:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-06 23:48:49,965 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:48:49,965 INFO L385 BasicCegarLoop]: trace histogram [55, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:48:50,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:50,170 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:48:50,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:48:50,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1240743319, now seen corresponding path program 6 times [2019-10-06 23:48:50,171 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:48:50,171 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:50,171 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:50,171 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:50,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:48:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1585 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-10-06 23:48:50,314 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:50,314 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:48:50,314 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:50,496 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:48:50,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:48:50,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-06 23:48:50,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:48:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1585 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-10-06 23:48:50,585 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:48:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1585 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-10-06 23:48:50,657 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:48:50,658 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:48:50,659 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:48:50,659 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:48:50,659 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:48:50,660 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:48:50,675 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:48:50,777 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:48:50,790 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:48:50,793 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:48:50,793 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:48:50,793 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:50,794 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:48:50,794 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:50,794 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:48:50,794 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:48:50,794 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:48:50,795 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-06 23:48:50,795 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:48:50,795 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:50,795 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:48:50,795 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:50,795 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:48:50,796 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:48:50,796 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:48:50,796 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:48:50,796 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:48:50,796 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:48:50,797 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:48:51,266 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:48:51,267 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 14] total 29 [2019-10-06 23:48:51,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-06 23:48:51,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-06 23:48:51,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2019-10-06 23:48:51,269 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 29 states. [2019-10-06 23:48:52,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:48:52,840 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2019-10-06 23:48:52,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-06 23:48:52,840 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 96 [2019-10-06 23:48:52,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:48:52,843 INFO L225 Difference]: With dead ends: 111 [2019-10-06 23:48:52,843 INFO L226 Difference]: Without dead ends: 91 [2019-10-06 23:48:52,844 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 265 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=454, Invalid=2516, Unknown=0, NotChecked=0, Total=2970 [2019-10-06 23:48:52,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-06 23:48:52,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-10-06 23:48:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-06 23:48:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2019-10-06 23:48:52,861 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 96 [2019-10-06 23:48:52,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:48:52,861 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2019-10-06 23:48:52,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-06 23:48:52,861 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2019-10-06 23:48:52,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-06 23:48:52,864 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:48:52,864 INFO L385 BasicCegarLoop]: trace histogram [55, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:48:53,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:53,069 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:48:53,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:48:53,070 INFO L82 PathProgramCache]: Analyzing trace with hash -950230236, now seen corresponding path program 7 times [2019-10-06 23:48:53,070 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:48:53,070 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:53,070 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:53,071 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:48:53,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:48:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 6 proven. 1540 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-06 23:48:54,356 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:54,356 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:48:54,356 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:48:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:54,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-06 23:48:54,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:48:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-06 23:48:54,592 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:48:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 6 proven. 1540 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-06 23:48:58,046 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:48:58,048 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:48:58,048 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:48:58,048 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:48:58,048 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:48:58,049 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:48:58,081 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:48:58,189 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:48:58,199 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:48:58,202 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:48:58,202 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:48:58,202 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:58,202 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:48:58,202 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:48:58,203 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:48:58,203 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:48:58,203 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:48:58,203 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-06 23:48:58,203 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:48:58,204 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:58,204 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:58,204 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:48:58,204 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:48:58,204 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:48:58,204 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:48:58,205 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:48:58,205 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:48:58,205 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:48:58,205 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:48:58,903 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:48:58,904 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58, 14] total 128 [2019-10-06 23:48:58,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-10-06 23:48:58,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-10-06 23:48:58,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6596, Invalid=9660, Unknown=0, NotChecked=0, Total=16256 [2019-10-06 23:48:58,908 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 128 states. [2019-10-06 23:49:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:49:08,603 INFO L93 Difference]: Finished difference Result 178 states and 244 transitions. [2019-10-06 23:49:08,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-10-06 23:49:08,604 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 98 [2019-10-06 23:49:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:49:08,605 INFO L225 Difference]: With dead ends: 178 [2019-10-06 23:49:08,605 INFO L226 Difference]: Without dead ends: 148 [2019-10-06 23:49:08,608 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12781 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=19565, Invalid=42685, Unknown=0, NotChecked=0, Total=62250 [2019-10-06 23:49:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-06 23:49:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-10-06 23:49:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-06 23:49:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 153 transitions. [2019-10-06 23:49:08,623 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 153 transitions. Word has length 98 [2019-10-06 23:49:08,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:49:08,624 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 153 transitions. [2019-10-06 23:49:08,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-10-06 23:49:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 153 transitions. [2019-10-06 23:49:08,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-06 23:49:08,627 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:49:08,627 INFO L385 BasicCegarLoop]: trace histogram [112, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:49:08,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:49:08,832 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:49:08,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:49:08,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1095501100, now seen corresponding path program 8 times [2019-10-06 23:49:08,833 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:49:08,833 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:49:08,833 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:49:08,833 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:49:08,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:49:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:49:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6381 backedges. 6 proven. 6328 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-06 23:49:13,655 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:49:13,655 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:49:13,655 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:49:13,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:49:13,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:49:13,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-06 23:49:13,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:49:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6381 backedges. 7 proven. 34 refuted. 0 times theorem prover too weak. 6340 trivial. 0 not checked. [2019-10-06 23:49:14,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:49:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6381 backedges. 7 proven. 34 refuted. 0 times theorem prover too weak. 6340 trivial. 0 not checked. [2019-10-06 23:49:15,543 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:49:15,544 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:49:15,544 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:49:15,545 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:49:15,545 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:49:15,545 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:49:15,570 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:49:15,686 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:49:15,699 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:49:15,701 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:49:15,701 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:49:15,702 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:49:15,702 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:49:15,702 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:49:15,702 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:49:15,702 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:49:15,702 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:49:15,703 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-06 23:49:15,703 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:49:15,703 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:49:15,703 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:49:15,703 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:49:15,703 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:49:15,704 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:49:15,704 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:49:15,704 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:49:15,704 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:49:15,704 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:49:15,704 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:49:17,268 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:49:17,269 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 15, 15, 14] total 153 [2019-10-06 23:49:17,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-10-06 23:49:17,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-10-06 23:49:17,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6684, Invalid=16572, Unknown=0, NotChecked=0, Total=23256 [2019-10-06 23:49:17,273 INFO L87 Difference]: Start difference. First operand 148 states and 153 transitions. Second operand 153 states. [2019-10-06 23:49:35,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:49:35,973 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2019-10-06 23:49:35,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-10-06 23:49:35,974 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 155 [2019-10-06 23:49:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:49:35,976 INFO L225 Difference]: With dead ends: 185 [2019-10-06 23:49:35,976 INFO L226 Difference]: Without dead ends: 155 [2019-10-06 23:49:35,981 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16017 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=20500, Invalid=65642, Unknown=0, NotChecked=0, Total=86142 [2019-10-06 23:49:35,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-06 23:49:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2019-10-06 23:49:35,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-06 23:49:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 158 transitions. [2019-10-06 23:49:35,998 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 158 transitions. Word has length 155 [2019-10-06 23:49:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:49:35,999 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 158 transitions. [2019-10-06 23:49:35,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-10-06 23:49:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2019-10-06 23:49:36,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-06 23:49:36,001 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:49:36,001 INFO L385 BasicCegarLoop]: trace histogram [113, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:49:36,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:49:36,206 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:49:36,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:49:36,207 INFO L82 PathProgramCache]: Analyzing trace with hash -605460296, now seen corresponding path program 9 times [2019-10-06 23:49:36,207 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:49:36,207 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:49:36,207 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:49:36,208 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:49:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:49:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:49:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6519 backedges. 8 proven. 6441 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:49:41,078 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:49:41,078 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:49:41,078 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:49:41,348 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:49:41,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:49:41,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-06 23:49:41,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:49:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6519 backedges. 34 proven. 20 refuted. 0 times theorem prover too weak. 6465 trivial. 0 not checked. [2019-10-06 23:49:41,845 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:49:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6519 backedges. 34 proven. 20 refuted. 0 times theorem prover too weak. 6465 trivial. 0 not checked. [2019-10-06 23:49:42,371 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:49:42,372 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:49:42,372 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:49:42,372 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:49:42,372 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:49:42,373 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:49:42,395 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:49:42,486 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:49:42,496 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:49:42,502 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:49:42,502 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:49:42,502 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:49:42,503 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:49:42,503 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:49:42,503 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:49:42,503 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:49:42,503 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:49:42,503 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-06 23:49:42,504 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:49:42,504 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:49:42,504 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:49:42,504 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:49:42,504 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:49:42,504 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:49:42,505 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:49:42,505 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:49:42,505 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:49:42,505 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:49:42,505 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:49:43,724 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:49:43,725 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 12, 12, 14] total 144 [2019-10-06 23:49:43,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-10-06 23:49:43,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-10-06 23:49:43,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6791, Invalid=13801, Unknown=0, NotChecked=0, Total=20592 [2019-10-06 23:49:43,728 INFO L87 Difference]: Start difference. First operand 152 states and 158 transitions. Second operand 144 states. [2019-10-06 23:49:59,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:49:59,970 INFO L93 Difference]: Finished difference Result 202 states and 219 transitions. [2019-10-06 23:49:59,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-10-06 23:49:59,971 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 163 [2019-10-06 23:49:59,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:49:59,972 INFO L225 Difference]: With dead ends: 202 [2019-10-06 23:49:59,973 INFO L226 Difference]: Without dead ends: 155 [2019-10-06 23:49:59,978 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 458 SyntacticMatches, 5 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15708 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=21271, Invalid=61385, Unknown=0, NotChecked=0, Total=82656 [2019-10-06 23:49:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-06 23:49:59,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-10-06 23:49:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-06 23:49:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 161 transitions. [2019-10-06 23:49:59,992 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 161 transitions. Word has length 163 [2019-10-06 23:49:59,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:49:59,992 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 161 transitions. [2019-10-06 23:49:59,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-10-06 23:49:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 161 transitions. [2019-10-06 23:49:59,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-06 23:49:59,994 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:49:59,995 INFO L385 BasicCegarLoop]: trace histogram [114, 6, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:50:00,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:50:00,199 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:50:00,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:50:00,200 INFO L82 PathProgramCache]: Analyzing trace with hash -98282469, now seen corresponding path program 10 times [2019-10-06 23:50:00,201 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:50:00,201 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:50:00,201 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:50:00,202 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:50:00,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:50:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:50:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6643 backedges. 8 proven. 6555 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-06 23:50:05,180 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:50:05,180 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:50:05,180 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:50:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:50:05,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 116 conjunts are in the unsatisfiable core [2019-10-06 23:50:05,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:50:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6643 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-10-06 23:50:05,548 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:50:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6643 backedges. 8 proven. 6555 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-06 23:50:19,939 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:50:19,940 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:50:19,940 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:50:19,941 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:50:19,941 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:50:19,941 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:50:19,957 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:50:20,073 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:50:20,084 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:50:20,086 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:50:20,086 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:50:20,086 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:50:20,086 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:50:20,087 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:50:20,087 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:50:20,087 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:50:20,087 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:50:20,087 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-06 23:50:20,087 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:50:20,087 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:50:20,088 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:50:20,088 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:50:20,088 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:50:20,088 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:50:20,088 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:50:20,088 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:50:20,089 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:50:20,089 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:50:20,089 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:50:21,174 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:50:21,175 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117, 117, 14] total 246 [2019-10-06 23:50:21,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 246 states [2019-10-06 23:50:21,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 246 interpolants. [2019-10-06 23:50:21,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27069, Invalid=33201, Unknown=0, NotChecked=0, Total=60270 [2019-10-06 23:50:21,183 INFO L87 Difference]: Start difference. First operand 155 states and 161 transitions. Second operand 246 states. [2019-10-06 23:50:55,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:50:55,608 INFO L93 Difference]: Finished difference Result 306 states and 433 transitions. [2019-10-06 23:50:55,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2019-10-06 23:50:55,608 INFO L78 Accepts]: Start accepts. Automaton has 246 states. Word has length 166 [2019-10-06 23:50:55,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:50:55,611 INFO L225 Difference]: With dead ends: 306 [2019-10-06 23:50:55,611 INFO L226 Difference]: Without dead ends: 271 [2019-10-06 23:50:55,621 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43107 ImplicationChecksByTransitivity, 53.0s TimeCoverageRelationStatistics Valid=80748, Invalid=154962, Unknown=0, NotChecked=0, Total=235710 [2019-10-06 23:50:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-06 23:50:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-10-06 23:50:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-10-06 23:50:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 277 transitions. [2019-10-06 23:50:55,642 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 277 transitions. Word has length 166 [2019-10-06 23:50:55,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:50:55,642 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 277 transitions. [2019-10-06 23:50:55,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 246 states. [2019-10-06 23:50:55,642 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 277 transitions. [2019-10-06 23:50:55,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-06 23:50:55,646 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:50:55,646 INFO L385 BasicCegarLoop]: trace histogram [230, 6, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:50:55,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:50:55,851 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:50:55,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:50:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash -537882597, now seen corresponding path program 11 times [2019-10-06 23:50:55,852 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:50:55,852 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:50:55,852 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:50:55,852 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:50:55,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:50:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:51:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 26653 backedges. 8 proven. 26565 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-06 23:51:15,384 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:51:15,384 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:51:15,385 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:51:15,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-06 23:51:15,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:51:15,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-06 23:51:15,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:51:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 26653 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 26589 trivial. 0 not checked. [2019-10-06 23:51:17,517 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:51:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 26653 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 26589 trivial. 0 not checked. [2019-10-06 23:51:19,288 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:51:19,290 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:51:19,290 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:51:19,290 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:51:19,290 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:51:19,291 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:51:19,308 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:51:19,409 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:51:19,426 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:51:19,429 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:51:19,429 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:51:19,430 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:51:19,430 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:51:19,430 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:51:19,430 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:51:19,431 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:51:19,431 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:51:19,431 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-06 23:51:19,431 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:51:19,431 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:51:19,432 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:51:19,432 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:51:19,432 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:51:19,432 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:51:19,432 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:51:19,432 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:51:19,433 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:51:19,433 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:51:19,433 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:51:21,540 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:51:21,541 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [233, 17, 17, 14] total 275 [2019-10-06 23:51:21,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 275 states [2019-10-06 23:51:21,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 275 interpolants. [2019-10-06 23:51:21,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27171, Invalid=48179, Unknown=0, NotChecked=0, Total=75350 [2019-10-06 23:51:21,548 INFO L87 Difference]: Start difference. First operand 271 states and 277 transitions. Second operand 275 states. [2019-10-06 23:52:18,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:52:18,080 INFO L93 Difference]: Finished difference Result 313 states and 327 transitions. [2019-10-06 23:52:18,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2019-10-06 23:52:18,080 INFO L78 Accepts]: Start accepts. Automaton has 275 states. Word has length 282 [2019-10-06 23:52:18,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:52:18,083 INFO L225 Difference]: With dead ends: 313 [2019-10-06 23:52:18,083 INFO L226 Difference]: Without dead ends: 278 [2019-10-06 23:52:18,095 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1342 GetRequests, 806 SyntacticMatches, 0 SemanticMatches, 536 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47770 ImplicationChecksByTransitivity, 72.4s TimeCoverageRelationStatistics Valid=82349, Invalid=206557, Unknown=0, NotChecked=0, Total=288906 [2019-10-06 23:52:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-06 23:52:18,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 275. [2019-10-06 23:52:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-06 23:52:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 282 transitions. [2019-10-06 23:52:18,118 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 282 transitions. Word has length 282 [2019-10-06 23:52:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:52:18,118 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 282 transitions. [2019-10-06 23:52:18,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 275 states. [2019-10-06 23:52:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 282 transitions. [2019-10-06 23:52:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-10-06 23:52:18,120 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:52:18,120 INFO L385 BasicCegarLoop]: trace histogram [231, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:52:18,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:52:18,321 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:52:18,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:52:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1397846065, now seen corresponding path program 12 times [2019-10-06 23:52:18,322 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:52:18,322 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:52:18,322 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:52:18,323 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:52:18,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:52:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:52:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 26916 backedges. 10 proven. 26796 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-06 23:52:37,644 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:52:37,644 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:52:37,644 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:52:38,130 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:52:38,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:52:38,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 1541 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-06 23:52:38,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:52:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 26916 backedges. 50 proven. 30 refuted. 0 times theorem prover too weak. 26836 trivial. 0 not checked. [2019-10-06 23:52:39,869 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:52:41,148 INFO L134 CoverageAnalysis]: Checked inductivity of 26916 backedges. 50 proven. 30 refuted. 0 times theorem prover too weak. 26836 trivial. 0 not checked. [2019-10-06 23:52:41,148 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:52:41,149 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:52:41,149 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:52:41,150 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:52:41,150 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:52:41,150 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:52:41,167 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:52:41,292 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:52:41,310 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:52:41,313 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:52:41,313 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:52:41,313 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:52:41,314 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:52:41,314 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:52:41,314 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:52:41,314 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:52:41,315 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:52:41,315 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-06 23:52:41,315 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:52:41,315 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:52:41,315 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:52:41,315 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:52:41,316 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:52:41,317 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:52:41,317 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:52:41,317 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:52:41,317 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:52:41,317 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:52:41,318 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:52:43,671 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:52:43,671 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [234, 14, 14, 14] total 265 [2019-10-06 23:52:43,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 265 states [2019-10-06 23:52:43,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 265 interpolants. [2019-10-06 23:52:43,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27410, Invalid=42550, Unknown=0, NotChecked=0, Total=69960 [2019-10-06 23:52:43,680 INFO L87 Difference]: Start difference. First operand 275 states and 282 transitions. Second operand 265 states. [2019-10-06 23:53:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:53:34,436 INFO L93 Difference]: Finished difference Result 333 states and 353 transitions. [2019-10-06 23:53:34,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 271 states. [2019-10-06 23:53:34,437 INFO L78 Accepts]: Start accepts. Automaton has 265 states. Word has length 290 [2019-10-06 23:53:34,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:53:34,439 INFO L225 Difference]: With dead ends: 333 [2019-10-06 23:53:34,439 INFO L226 Difference]: Without dead ends: 278 [2019-10-06 23:53:34,450 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1370 GetRequests, 835 SyntacticMatches, 6 SemanticMatches, 529 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47100 ImplicationChecksByTransitivity, 68.6s TimeCoverageRelationStatistics Valid=84131, Invalid=197299, Unknown=0, NotChecked=0, Total=281430 [2019-10-06 23:53:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-06 23:53:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-10-06 23:53:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-06 23:53:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 285 transitions. [2019-10-06 23:53:34,473 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 285 transitions. Word has length 290 [2019-10-06 23:53:34,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:53:34,474 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 285 transitions. [2019-10-06 23:53:34,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 265 states. [2019-10-06 23:53:34,474 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 285 transitions. [2019-10-06 23:53:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-06 23:53:34,476 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:53:34,476 INFO L385 BasicCegarLoop]: trace histogram [232, 7, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:53:34,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:53:34,682 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:53:34,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:53:34,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1272512466, now seen corresponding path program 13 times [2019-10-06 23:53:34,683 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:53:34,683 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:53:34,683 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:53:34,683 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:53:34,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:53:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:53:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 27160 backedges. 10 proven. 27028 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-06 23:53:54,107 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:53:54,107 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:53:54,107 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:53:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:53:54,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 1552 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-06 23:53:54,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:53:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 27160 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-06 23:53:54,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:54:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 27160 backedges. 10 proven. 27028 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-06 23:54:51,934 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:54:51,936 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:54:51,936 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:54:51,936 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:54:51,936 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:54:51,937 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:54:51,957 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:54:52,063 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:54:52,075 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:54:52,077 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:54:52,078 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:54:52,078 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:54:52,078 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:54:52,078 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:54:52,078 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:54:52,079 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:54:52,079 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:54:52,079 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-06 23:54:52,079 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:54:52,079 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:54:52,079 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:54:52,079 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:54:52,080 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:54:52,080 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:54:52,080 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:54:52,080 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:54:52,080 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:54:52,080 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:54:52,081 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:54:53,894 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:54:53,895 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 14] total 482 [2019-10-06 23:54:53,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 482 states [2019-10-06 23:54:53,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 482 interpolants. [2019-10-06 23:54:53,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109787, Invalid=122055, Unknown=0, NotChecked=0, Total=231842 [2019-10-06 23:54:53,912 INFO L87 Difference]: Start difference. First operand 278 states and 285 transitions. Second operand 482 states. [2019-10-06 23:57:03,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:57:03,807 INFO L93 Difference]: Finished difference Result 552 states and 799 transitions. [2019-10-06 23:57:03,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 481 states. [2019-10-06 23:57:03,807 INFO L78 Accepts]: Start accepts. Automaton has 482 states. Word has length 293 [2019-10-06 23:57:03,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:57:03,811 INFO L225 Difference]: With dead ends: 552 [2019-10-06 23:57:03,812 INFO L226 Difference]: Without dead ends: 512 [2019-10-06 23:57:03,840 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1589 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 956 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155974 ImplicationChecksByTransitivity, 199.8s TimeCoverageRelationStatistics Valid=328430, Invalid=588376, Unknown=0, NotChecked=0, Total=916806 [2019-10-06 23:57:03,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-10-06 23:57:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2019-10-06 23:57:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-06 23:57:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 519 transitions. [2019-10-06 23:57:03,869 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 519 transitions. Word has length 293 [2019-10-06 23:57:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:57:03,870 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 519 transitions. [2019-10-06 23:57:03,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 482 states. [2019-10-06 23:57:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 519 transitions. [2019-10-06 23:57:03,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-10-06 23:57:03,874 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:57:03,875 INFO L385 BasicCegarLoop]: trace histogram [466, 7, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:57:04,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:57:04,081 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:57:04,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:57:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1407177262, now seen corresponding path program 14 times [2019-10-06 23:57:04,082 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:57:04,082 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:57:04,083 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:57:04,083 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:57:04,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:57:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:58:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 108943 backedges. 10 proven. 108811 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-06 23:58:21,340 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:58:21,340 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:58:21,340 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:58:22,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-06 23:58:22,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:58:22,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-06 23:58:22,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:58:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 108943 backedges. 10 proven. 82 refuted. 0 times theorem prover too weak. 108851 trivial. 0 not checked. [2019-10-06 23:58:26,446 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:58:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 108943 backedges. 11 proven. 81 refuted. 0 times theorem prover too weak. 108851 trivial. 0 not checked. [2019-10-06 23:58:31,532 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:58:31,533 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:58:31,534 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:58:31,534 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:58:31,535 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:58:31,535 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:58:31,554 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:58:31,649 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:58:31,662 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:58:31,664 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:58:31,664 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:58:31,664 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:58:31,664 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-06 23:58:31,665 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:58:31,665 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:58:31,665 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:58:31,665 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:58:31,665 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-06 23:58:31,665 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:58:31,666 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:58:31,666 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:58:31,666 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:58:31,666 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:58:31,666 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:58:31,666 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:58:31,667 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-06 23:58:31,667 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= main_~e~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))))) [2019-10-06 23:58:31,667 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:58:31,667 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:58:35,417 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:58:35,417 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [469, 19, 19, 14] total 515 [2019-10-06 23:58:35,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 515 states [2019-10-06 23:58:35,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 515 interpolants. [2019-10-06 23:58:35,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109896, Invalid=154814, Unknown=0, NotChecked=0, Total=264710 [2019-10-06 23:58:35,442 INFO L87 Difference]: Start difference. First operand 512 states and 519 transitions. Second operand 515 states.