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/sanfoundry_27_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:17:27,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:17:27,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:17:27,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:17:27,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:17:27,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:17:27,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:17:27,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:17:27,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:17:27,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:17:27,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:17:27,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:17:27,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:17:27,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:17:27,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:17:27,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:17:27,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:17:27,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:17:27,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:17:27,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:17:27,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:17:27,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:17:27,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:17:27,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:17:27,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:17:27,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:17:27,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:17:27,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:17:27,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:17:27,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:17:27,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:17:27,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:17:27,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:17:27,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:17:27,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:17:27,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:17:27,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:17:27,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:17:27,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:17:27,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:17:27,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:17:27,976 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:17:27,997 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:17:27,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:17:28,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:17:28,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:17:28,002 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:17:28,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:17:28,002 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:17:28,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:17:28,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:17:28,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:17:28,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:17:28,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:17:28,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:17:28,005 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:17:28,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:17:28,005 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:17:28,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:17:28,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:17:28,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:17:28,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:17:28,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:17:28,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:17:28,007 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:17:28,007 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:17:28,007 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:17:28,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:17:28,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:17:28,008 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:17:28,008 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:17:28,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:17:28,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:17:28,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:17:28,331 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:17:28,331 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:17:28,332 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_27_ground.i [2019-10-06 23:17:28,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b934a39f/b73e823d8f884d8f8d00d533f19b4b5e/FLAG923fb6141 [2019-10-06 23:17:28,799 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:17:28,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_27_ground.i [2019-10-06 23:17:28,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b934a39f/b73e823d8f884d8f8d00d533f19b4b5e/FLAG923fb6141 [2019-10-06 23:17:29,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b934a39f/b73e823d8f884d8f8d00d533f19b4b5e [2019-10-06 23:17:29,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:17:29,208 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:17:29,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:17:29,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:17:29,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:17:29,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:17:29" (1/1) ... [2019-10-06 23:17:29,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337d46e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:29, skipping insertion in model container [2019-10-06 23:17:29,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:17:29" (1/1) ... [2019-10-06 23:17:29,224 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:17:29,240 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:17:29,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:17:29,448 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:17:29,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:17:29,481 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:17:29,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:29 WrapperNode [2019-10-06 23:17:29,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:17:29,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:17:29,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:17:29,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:17:29,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:29" (1/1) ... [2019-10-06 23:17:29,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:29" (1/1) ... [2019-10-06 23:17:29,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:29" (1/1) ... [2019-10-06 23:17:29,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:29" (1/1) ... [2019-10-06 23:17:29,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:29" (1/1) ... [2019-10-06 23:17:29,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:29" (1/1) ... [2019-10-06 23:17:29,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:29" (1/1) ... [2019-10-06 23:17:29,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:17:29,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:17:29,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:17:29,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:17:29,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:29" (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:17:29,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:17:29,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:17:29,656 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:17:29,656 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:17:29,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:17:29,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:17:29,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:17:29,657 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:17:29,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:17:29,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:17:29,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:17:29,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:17:29,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:17:29,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:17:30,014 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:17:30,014 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-06 23:17:30,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:17:30 BoogieIcfgContainer [2019-10-06 23:17:30,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:17:30,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:17:30,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:17:30,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:17:30,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:17:29" (1/3) ... [2019-10-06 23:17:30,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad6d1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:17:30, skipping insertion in model container [2019-10-06 23:17:30,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:29" (2/3) ... [2019-10-06 23:17:30,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad6d1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:17:30, skipping insertion in model container [2019-10-06 23:17:30,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:17:30" (3/3) ... [2019-10-06 23:17:30,024 INFO L109 eAbstractionObserver]: Analyzing ICFG sanfoundry_27_ground.i [2019-10-06 23:17:30,040 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:17:30,056 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:17:30,069 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:17:30,091 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:17:30,091 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:17:30,091 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:17:30,091 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:17:30,091 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:17:30,091 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:17:30,092 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:17:30,092 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:17:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-06 23:17:30,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-06 23:17:30,110 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:30,111 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:30,112 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:30,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1947700096, now seen corresponding path program 1 times [2019-10-06 23:17:30,123 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:30,123 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:30,123 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:30,124 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:30,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:30,277 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:17:30,278 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:30,278 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:17:30,279 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:17:30,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:17:30,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:17:30,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:17:30,294 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-06 23:17:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:30,343 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-06 23:17:30,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:17:30,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-06 23:17:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:30,355 INFO L225 Difference]: With dead ends: 33 [2019-10-06 23:17:30,355 INFO L226 Difference]: Without dead ends: 17 [2019-10-06 23:17:30,359 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:17:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-06 23:17:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-06 23:17:30,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-06 23:17:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-06 23:17:30,414 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-06 23:17:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:30,415 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-06 23:17:30,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:17:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-06 23:17:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:17:30,418 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:30,419 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:30,419 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:30,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:30,421 INFO L82 PathProgramCache]: Analyzing trace with hash 520805519, now seen corresponding path program 1 times [2019-10-06 23:17:30,421 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:30,421 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:30,422 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:30,422 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:30,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:17:30,490 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:30,491 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:17:30,491 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:17:30,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:17:30,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:17:30,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:17:30,494 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-06 23:17:30,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:30,521 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-10-06 23:17:30,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:17:30,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-06 23:17:30,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:30,523 INFO L225 Difference]: With dead ends: 27 [2019-10-06 23:17:30,524 INFO L226 Difference]: Without dead ends: 18 [2019-10-06 23:17:30,526 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:17:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-06 23:17:30,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-06 23:17:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-06 23:17:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-06 23:17:30,536 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-06 23:17:30,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:30,537 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-06 23:17:30,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:17:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-06 23:17:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:17:30,540 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:30,541 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:30,541 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:30,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:30,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1773270914, now seen corresponding path program 1 times [2019-10-06 23:17:30,542 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:30,542 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:30,543 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:30,543 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:17:30,617 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:30,617 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:30,617 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:17:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:30,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:17:30,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:17:30,750 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:17:30,785 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:30,813 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:17:30,813 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:30,825 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:30,833 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:30,833 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:31,015 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:17:31,283 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:31,315 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:17:31,321 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:31,322 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:31,322 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(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:17:31,322 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 1 main_~i~0) (= main_~x~0 0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~x~0) |main_~#array~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:31,323 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 110#(<= 1 main_~i~0) [2019-10-06 23:17:31,323 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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:17:31,323 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:17:31,324 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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:17:31,324 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:17:31,324 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:17:31,325 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:17:31,325 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:17:31,325 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:31,325 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 1 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:31,326 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(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:17:31,716 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:31,716 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-06 23:17:31,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:17:31,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:17:31,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-06 23:17:31,722 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 17 states. [2019-10-06 23:17:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:32,278 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2019-10-06 23:17:32,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-06 23:17:32,279 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-10-06 23:17:32,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:32,281 INFO L225 Difference]: With dead ends: 37 [2019-10-06 23:17:32,282 INFO L226 Difference]: Without dead ends: 26 [2019-10-06 23:17:32,283 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:17:32,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-06 23:17:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-10-06 23:17:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-06 23:17:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-06 23:17:32,294 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2019-10-06 23:17:32,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:32,294 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-06 23:17:32,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:17:32,295 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-06 23:17:32,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-06 23:17:32,296 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:32,296 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:32,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:32,502 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:32,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:32,502 INFO L82 PathProgramCache]: Analyzing trace with hash 503527757, now seen corresponding path program 2 times [2019-10-06 23:17:32,503 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:32,503 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:32,503 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:32,503 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:32,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:17:32,577 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:32,577 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:32,577 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:17:32,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:17:32,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:17:32,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:17:32,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:17:32,663 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:17:32,729 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:32,730 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:17:32,730 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:32,731 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:32,732 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:32,733 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:32,779 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:17:32,934 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:32,968 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:17:32,974 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:32,974 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:32,975 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(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:17:32,975 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 1 main_~i~0) (= main_~x~0 0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~x~0) |main_~#array~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:32,976 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 110#(<= 1 main_~i~0) [2019-10-06 23:17:32,976 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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:17:32,977 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:17:32,977 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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:17:32,978 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:17:32,978 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:17:32,978 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:17:32,979 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:17:32,979 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:32,979 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 1 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:32,979 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(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:17:33,281 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:33,281 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 23 [2019-10-06 23:17:33,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-06 23:17:33,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-06 23:17:33,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-10-06 23:17:33,283 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 23 states. [2019-10-06 23:17:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:33,941 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2019-10-06 23:17:33,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-06 23:17:33,942 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2019-10-06 23:17:33,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:33,943 INFO L225 Difference]: With dead ends: 51 [2019-10-06 23:17:33,943 INFO L226 Difference]: Without dead ends: 38 [2019-10-06 23:17:33,944 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=301, Invalid=1259, Unknown=0, NotChecked=0, Total=1560 [2019-10-06 23:17:33,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-06 23:17:33,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-10-06 23:17:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-06 23:17:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-10-06 23:17:33,953 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2019-10-06 23:17:33,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:33,953 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-10-06 23:17:33,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-06 23:17:33,954 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-10-06 23:17:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-06 23:17:33,955 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:33,955 INFO L385 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:34,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:34,159 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:34,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:34,160 INFO L82 PathProgramCache]: Analyzing trace with hash 677366477, now seen corresponding path program 3 times [2019-10-06 23:17:34,160 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:34,160 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:34,160 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:34,160 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:34,355 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-06 23:17:34,355 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:34,356 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:34,356 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:34,427 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:17:34,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:17:34,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:17:34,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-06 23:17:34,462 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-06 23:17:34,645 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:34,647 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:17:34,647 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:34,647 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:34,648 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:34,648 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:34,673 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:17:34,763 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:34,784 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:17:34,788 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:34,788 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:34,789 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(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:17:34,789 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 1 main_~i~0) (= main_~x~0 0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~x~0) |main_~#array~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:34,789 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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:17:34,789 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 110#(<= 1 main_~i~0) [2019-10-06 23:17:34,790 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:17:34,790 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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:17:34,790 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:17:34,790 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:17:34,791 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:17:34,791 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:17:34,791 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:34,791 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 1 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:34,792 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(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:17:35,104 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:35,105 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13, 11] total 35 [2019-10-06 23:17:35,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-06 23:17:35,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-06 23:17:35,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-06 23:17:35,107 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 35 states. [2019-10-06 23:17:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:36,849 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2019-10-06 23:17:36,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-06 23:17:36,849 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2019-10-06 23:17:36,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:36,850 INFO L225 Difference]: With dead ends: 81 [2019-10-06 23:17:36,851 INFO L226 Difference]: Without dead ends: 62 [2019-10-06 23:17:36,857 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2038 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1711, Invalid=5429, Unknown=0, NotChecked=0, Total=7140 [2019-10-06 23:17:36,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-06 23:17:36,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2019-10-06 23:17:36,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-06 23:17:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-10-06 23:17:36,876 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 31 [2019-10-06 23:17:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:36,877 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-10-06 23:17:36,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-06 23:17:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-10-06 23:17:36,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-06 23:17:36,881 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:36,881 INFO L385 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:37,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:37,085 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:37,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:37,086 INFO L82 PathProgramCache]: Analyzing trace with hash -170402355, now seen corresponding path program 4 times [2019-10-06 23:17:37,087 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:37,087 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:37,087 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:37,088 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:37,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-06 23:17:37,846 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:37,846 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:37,846 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:37,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-06 23:17:37,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-06 23:17:37,985 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-06 23:17:38,709 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:38,710 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:17:38,710 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:38,710 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:38,711 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:38,711 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:38,742 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:17:38,877 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:38,897 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:17:38,902 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:38,902 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:38,902 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(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:17:38,904 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 1 main_~i~0) (= main_~x~0 0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~x~0) |main_~#array~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:38,905 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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:17:38,905 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 110#(<= 1 main_~i~0) [2019-10-06 23:17:38,905 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:17:38,906 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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:17:38,906 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:17:38,906 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:17:38,906 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:17:38,906 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:17:38,907 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:38,907 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 1 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:38,907 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(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:17:39,324 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:39,324 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 11] total 59 [2019-10-06 23:17:39,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-06 23:17:39,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-06 23:17:39,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1205, Invalid=2217, Unknown=0, NotChecked=0, Total=3422 [2019-10-06 23:17:39,329 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 59 states. [2019-10-06 23:17:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:42,713 INFO L93 Difference]: Finished difference Result 141 states and 193 transitions. [2019-10-06 23:17:42,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-06 23:17:42,716 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2019-10-06 23:17:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:42,718 INFO L225 Difference]: With dead ends: 141 [2019-10-06 23:17:42,718 INFO L226 Difference]: Without dead ends: 110 [2019-10-06 23:17:42,725 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2754 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3559, Invalid=8873, Unknown=0, NotChecked=0, Total=12432 [2019-10-06 23:17:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-06 23:17:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-10-06 23:17:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-06 23:17:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2019-10-06 23:17:42,742 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 55 [2019-10-06 23:17:42,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:42,743 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2019-10-06 23:17:42,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-06 23:17:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2019-10-06 23:17:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-06 23:17:42,745 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:42,745 INFO L385 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:42,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:42,950 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:42,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1764506675, now seen corresponding path program 5 times [2019-10-06 23:17:42,951 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:42,952 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:42,952 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:42,952 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-10-06 23:17:43,980 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:43,980 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:43,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:04,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-06 23:18:04,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:04,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-06 23:18:04,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-06 23:18:05,019 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-06 23:18:07,374 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:07,375 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:18:07,375 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:07,376 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:07,376 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:07,376 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:07,403 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:07,472 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:18:07,483 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:07,486 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:07,486 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:07,486 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(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:18:07,487 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 1 main_~i~0) (= main_~x~0 0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~x~0) |main_~#array~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:07,487 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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:18:07,487 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 110#(<= 1 main_~i~0) [2019-10-06 23:18:07,487 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:07,487 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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:18:07,488 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:18:07,488 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:18:07,488 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:18:07,488 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:18:07,488 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:07,489 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 1 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:07,489 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(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:18:07,978 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:07,978 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48, 11] total 105 [2019-10-06 23:18:07,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-10-06 23:18:07,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-10-06 23:18:07,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4494, Invalid=6426, Unknown=0, NotChecked=0, Total=10920 [2019-10-06 23:18:07,984 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 105 states. [2019-10-06 23:18:15,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:15,778 INFO L93 Difference]: Finished difference Result 259 states and 357 transitions. [2019-10-06 23:18:15,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-10-06 23:18:15,779 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 103 [2019-10-06 23:18:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:15,782 INFO L225 Difference]: With dead ends: 259 [2019-10-06 23:18:15,782 INFO L226 Difference]: Without dead ends: 204 [2019-10-06 23:18:15,790 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7928 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13568, Invalid=28252, Unknown=0, NotChecked=0, Total=41820 [2019-10-06 23:18:15,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-06 23:18:15,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-10-06 23:18:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-06 23:18:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 203 transitions. [2019-10-06 23:18:15,815 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 203 transitions. Word has length 103 [2019-10-06 23:18:15,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:15,815 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 203 transitions. [2019-10-06 23:18:15,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-10-06 23:18:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 203 transitions. [2019-10-06 23:18:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-06 23:18:15,819 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:15,819 INFO L385 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:16,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:16,020 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:16,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:16,021 INFO L82 PathProgramCache]: Analyzing trace with hash 91212943, now seen corresponding path program 6 times [2019-10-06 23:18:16,022 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:16,022 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:16,022 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:16,022 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:16,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-10-06 23:18:19,494 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:19,494 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:19,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:19,736 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:18:19,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:19,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 95 conjunts are in the unsatisfiable core [2019-10-06 23:18:19,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-10-06 23:18:19,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-10-06 23:18:28,972 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:28,973 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:18:28,973 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:28,974 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:28,974 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:28,974 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:28,996 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:29,054 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:18:29,065 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:29,069 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:29,069 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:29,069 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(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:18:29,070 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 1 main_~i~0) (= main_~x~0 0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~x~0) |main_~#array~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:29,070 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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:18:29,071 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 110#(<= 1 main_~i~0) [2019-10-06 23:18:29,071 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:29,071 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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:18:29,071 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:18:29,072 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:18:29,072 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:18:29,073 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:18:29,073 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:29,073 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 1 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:29,073 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(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:18:29,761 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:29,762 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96, 11] total 201 [2019-10-06 23:18:29,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 201 states [2019-10-06 23:18:29,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2019-10-06 23:18:29,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18174, Invalid=22026, Unknown=0, NotChecked=0, Total=40200 [2019-10-06 23:18:29,769 INFO L87 Difference]: Start difference. First operand 201 states and 203 transitions. Second operand 201 states. [2019-10-06 23:18:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:59,282 INFO L93 Difference]: Finished difference Result 496 states and 690 transitions. [2019-10-06 23:18:59,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2019-10-06 23:18:59,283 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 197 [2019-10-06 23:18:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:59,286 INFO L225 Difference]: With dead ends: 496 [2019-10-06 23:18:59,287 INFO L226 Difference]: Without dead ends: 394 [2019-10-06 23:18:59,294 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1069 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 394 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27817 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=54324, Invalid=102096, Unknown=0, NotChecked=0, Total=156420 [2019-10-06 23:18:59,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-10-06 23:18:59,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2019-10-06 23:18:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-10-06 23:18:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 393 transitions. [2019-10-06 23:18:59,332 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 393 transitions. Word has length 197 [2019-10-06 23:18:59,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:59,333 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 393 transitions. [2019-10-06 23:18:59,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 201 states. [2019-10-06 23:18:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 393 transitions. [2019-10-06 23:18:59,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-10-06 23:18:59,341 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:59,341 INFO L385 BasicCegarLoop]: trace histogram [188, 187, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:59,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:59,559 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:59,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:59,560 INFO L82 PathProgramCache]: Analyzing trace with hash 897910605, now seen corresponding path program 7 times [2019-10-06 23:18:59,560 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:59,560 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:59,561 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:59,561 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:59,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:19:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:19:12,839 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 17578 trivial. 0 not checked. [2019-10-06 23:19:12,840 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:19:12,840 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:19:12,840 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:19:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:19:13,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 1932 conjuncts, 190 conjunts are in the unsatisfiable core [2019-10-06 23:19:13,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:19:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 17578 trivial. 0 not checked. [2019-10-06 23:19:13,448 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:19:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 17578 trivial. 0 not checked. [2019-10-06 23:19:50,413 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:19:50,415 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:19:50,415 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:19:50,415 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:19:50,416 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:19:50,416 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:19:50,447 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:19:50,511 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:19:50,520 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:19:50,522 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:19:50,522 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:19:50,523 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(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:19:50,523 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 1 main_~i~0) (= main_~x~0 0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~x~0) |main_~#array~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:19:50,523 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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:19:50,523 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 110#(<= 1 main_~i~0) [2019-10-06 23:19:50,523 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:19:50,524 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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:19:50,524 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:19:50,524 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:19:50,524 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:19:50,524 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-06 23:19:50,525 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:19:50,525 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 1 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:19:50,525 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(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:19:51,657 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:19:51,657 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [191, 191, 191, 11] total 391 [2019-10-06 23:19:51,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 391 states [2019-10-06 23:19:51,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 391 interpolants. [2019-10-06 23:19:51,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72419, Invalid=80071, Unknown=0, NotChecked=0, Total=152490 [2019-10-06 23:19:51,676 INFO L87 Difference]: Start difference. First operand 391 states and 393 transitions. Second operand 391 states. [2019-10-06 23:22:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:22:20,725 INFO L93 Difference]: Finished difference Result 971 states and 1355 transitions. [2019-10-06 23:22:20,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 390 states. [2019-10-06 23:22:20,726 INFO L78 Accepts]: Start accepts. Automaton has 391 states. Word has length 387 [2019-10-06 23:22:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:22:20,733 INFO L225 Difference]: With dead ends: 971 [2019-10-06 23:22:20,733 INFO L226 Difference]: Without dead ends: 774 [2019-10-06 23:22:20,750 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2114 GetRequests, 1340 SyntacticMatches, 0 SemanticMatches, 774 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100777 ImplicationChecksByTransitivity, 131.9s TimeCoverageRelationStatistics Valid=216869, Invalid=384531, Unknown=0, NotChecked=0, Total=601400 [2019-10-06 23:22:20,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-10-06 23:22:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 771. [2019-10-06 23:22:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-10-06 23:22:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 773 transitions. [2019-10-06 23:22:20,801 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 773 transitions. Word has length 387 [2019-10-06 23:22:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:22:20,802 INFO L462 AbstractCegarLoop]: Abstraction has 771 states and 773 transitions. [2019-10-06 23:22:20,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 391 states. [2019-10-06 23:22:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 773 transitions. [2019-10-06 23:22:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2019-10-06 23:22:20,824 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:22:20,825 INFO L385 BasicCegarLoop]: trace histogram [378, 377, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:22:21,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:22:21,032 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:22:21,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:22:21,033 INFO L82 PathProgramCache]: Analyzing trace with hash 437839565, now seen corresponding path program 8 times [2019-10-06 23:22:21,033 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:22:21,033 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:22:21,034 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:22:21,034 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:22:21,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:22:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:23:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 142884 backedges. 0 proven. 71631 refuted. 0 times theorem prover too weak. 71253 trivial. 0 not checked. [2019-10-06 23:23:11,954 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:23:11,954 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:23:11,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true