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_02_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:16:55,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:16:55,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:16:55,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:16:55,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:16:55,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:16:55,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:16:55,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:16:55,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:16:55,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:16:55,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:16:55,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:16:55,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:16:55,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:16:55,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:16:55,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:16:55,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:16:55,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:16:55,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:16:55,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:16:55,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:16:55,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:16:55,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:16:55,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:16:55,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:16:55,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:16:55,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:16:55,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:16:55,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:16:55,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:16:55,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:16:55,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:16:55,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:16:55,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:16:55,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:16:55,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:16:55,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:16:55,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:16:55,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:16:55,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:16:55,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:16:55,557 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:16:55,571 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:16:55,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:16:55,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:16:55,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:16:55,573 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:16:55,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:16:55,574 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:16:55,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:16:55,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:16:55,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:16:55,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:16:55,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:16:55,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:16:55,575 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:16:55,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:16:55,575 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:16:55,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:16:55,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:16:55,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:16:55,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:16:55,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:16:55,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:16:55,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:16:55,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:16:55,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:16:55,578 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:16:55,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:16:55,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:16:55,578 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:16:55,848 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:16:55,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:16:55,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:16:55,865 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:16:55,865 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:16:55,866 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_02_ground.i [2019-10-06 23:16:55,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74e860c4d/ab72a7b2154345e3a19a1e3b67562351/FLAG67267e220 [2019-10-06 23:16:56,419 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:16:56,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_02_ground.i [2019-10-06 23:16:56,427 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74e860c4d/ab72a7b2154345e3a19a1e3b67562351/FLAG67267e220 [2019-10-06 23:16:56,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74e860c4d/ab72a7b2154345e3a19a1e3b67562351 [2019-10-06 23:16:56,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:16:56,851 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:16:56,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:16:56,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:16:56,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:16:56,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:16:56" (1/1) ... [2019-10-06 23:16:56,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3304fef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:56, skipping insertion in model container [2019-10-06 23:16:56,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:16:56" (1/1) ... [2019-10-06 23:16:56,871 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:16:56,892 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:16:57,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:16:57,058 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:16:57,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:16:57,110 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:16:57,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:57 WrapperNode [2019-10-06 23:16:57,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:16:57,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:16:57,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:16:57,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:16:57,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:57" (1/1) ... [2019-10-06 23:16:57,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:57" (1/1) ... [2019-10-06 23:16:57,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:57" (1/1) ... [2019-10-06 23:16:57,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:57" (1/1) ... [2019-10-06 23:16:57,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:57" (1/1) ... [2019-10-06 23:16:57,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:57" (1/1) ... [2019-10-06 23:16:57,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:57" (1/1) ... [2019-10-06 23:16:57,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:16:57,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:16:57,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:16:57,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:16:57,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:57" (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:16:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:16:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:16:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:16:57,298 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:16:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:16:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:16:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:16:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:16:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:16:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:16:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:16:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:16:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:16:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:16:57,794 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:16:57,794 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-06 23:16:57,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:16:57 BoogieIcfgContainer [2019-10-06 23:16:57,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:16:57,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:16:57,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:16:57,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:16:57,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:16:56" (1/3) ... [2019-10-06 23:16:57,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e26553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:16:57, skipping insertion in model container [2019-10-06 23:16:57,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:57" (2/3) ... [2019-10-06 23:16:57,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e26553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:16:57, skipping insertion in model container [2019-10-06 23:16:57,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:16:57" (3/3) ... [2019-10-06 23:16:57,803 INFO L109 eAbstractionObserver]: Analyzing ICFG sanfoundry_02_ground.i [2019-10-06 23:16:57,812 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:16:57,819 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:16:57,830 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:16:57,854 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:16:57,854 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:16:57,854 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:16:57,855 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:16:57,855 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:16:57,855 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:16:57,855 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:16:57,855 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:16:57,872 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-06 23:16:57,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-06 23:16:57,879 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:57,880 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:57,881 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:57,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash -556049670, now seen corresponding path program 1 times [2019-10-06 23:16:57,894 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:57,894 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:57,894 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:57,895 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:58,039 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:16:58,041 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:58,042 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:58,042 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:16:58,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:16:58,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:16:58,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:16:58,060 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2019-10-06 23:16:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:58,101 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-10-06 23:16:58,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:16:58,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-06 23:16:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:58,115 INFO L225 Difference]: With dead ends: 39 [2019-10-06 23:16:58,115 INFO L226 Difference]: Without dead ends: 20 [2019-10-06 23:16:58,122 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:16:58,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-06 23:16:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-06 23:16:58,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-06 23:16:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-06 23:16:58,176 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2019-10-06 23:16:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:58,177 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-06 23:16:58,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:16:58,178 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-06 23:16:58,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:16:58,181 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:58,181 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:58,182 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:58,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:58,184 INFO L82 PathProgramCache]: Analyzing trace with hash -275638623, now seen corresponding path program 1 times [2019-10-06 23:16:58,184 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:58,185 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:58,185 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:58,185 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:58,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:58,262 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:16:58,262 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:58,263 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:58,263 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:16:58,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:16:58,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:16:58,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:16:58,265 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-06 23:16:58,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:58,288 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-06 23:16:58,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:16:58,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-06 23:16:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:58,290 INFO L225 Difference]: With dead ends: 33 [2019-10-06 23:16:58,290 INFO L226 Difference]: Without dead ends: 21 [2019-10-06 23:16:58,291 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:16:58,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-06 23:16:58,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-06 23:16:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:16:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-06 23:16:58,297 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2019-10-06 23:16:58,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:58,297 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-06 23:16:58,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:16:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-06 23:16:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:16:58,299 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:58,299 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:58,299 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:58,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:58,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1658314951, now seen corresponding path program 1 times [2019-10-06 23:16:58,300 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:58,300 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:58,300 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:58,300 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:58,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:58,377 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:16:58,378 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:58,378 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:58,378 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:16:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:58,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:16:58,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:58,479 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:16:58,480 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:58,519 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:16:58,519 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:58,544 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:16:58,545 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:58,551 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:58,559 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:58,560 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:58,759 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:16:59,073 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:59,107 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:16:59,124 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:59,125 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:59,125 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 141#(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:16:59,125 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 146#(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:16:59,125 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:16:59,126 INFO L193 IcfgInterpreter]: Reachable states at location L26-2 satisfy 121#(<= 2 main_~i~0) [2019-10-06 23:16:59,127 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 126#(and (<= 2 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:16:59,129 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:16:59,130 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:16:59,130 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(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:16:59,131 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:59,131 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:59,132 INFO L193 IcfgInterpreter]: Reachable states at location L40 satisfy 131#(and (< main_~x~0 100000) (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~x~0) |main_~#array~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:16:59,132 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(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:16:59,132 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:16:59,460 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:59,460 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-06 23:16:59,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:16:59,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:16:59,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:16:59,463 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 18 states. [2019-10-06 23:17:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:00,157 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-10-06 23:17:00,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-06 23:17:00,159 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-06 23:17:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:00,160 INFO L225 Difference]: With dead ends: 46 [2019-10-06 23:17:00,160 INFO L226 Difference]: Without dead ends: 32 [2019-10-06 23:17:00,163 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=979, Unknown=0, NotChecked=0, Total=1190 [2019-10-06 23:17:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-06 23:17:00,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-10-06 23:17:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-06 23:17:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-06 23:17:00,179 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 14 [2019-10-06 23:17:00,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:00,181 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-06 23:17:00,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:17:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-06 23:17:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-06 23:17:00,182 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:00,182 INFO L385 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:00,386 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:00,386 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:00,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:00,387 INFO L82 PathProgramCache]: Analyzing trace with hash -716975334, now seen corresponding path program 2 times [2019-10-06 23:17:00,387 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:00,388 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:00,388 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:00,388 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:17:00,501 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:00,501 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:00,501 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:00,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:17:00,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:17:00,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:17:00,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:17:00,580 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:17:00,648 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:00,649 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:17:00,650 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:00,650 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:00,651 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:00,652 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:00,700 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:17:00,865 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:00,894 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:17:00,905 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:00,905 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:00,905 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 141#(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:00,905 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 146#(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:00,906 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:17:00,907 INFO L193 IcfgInterpreter]: Reachable states at location L26-2 satisfy 121#(<= 2 main_~i~0) [2019-10-06 23:17:00,907 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 126#(and (<= 2 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:00,907 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:00,908 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:00,908 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(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:00,908 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:00,908 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:00,909 INFO L193 IcfgInterpreter]: Reachable states at location L40 satisfy 131#(and (< main_~x~0 100000) (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~x~0) |main_~#array~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:00,909 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(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:17:00,909 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:17:01,222 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:01,223 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 22 [2019-10-06 23:17:01,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-06 23:17:01,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-06 23:17:01,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-10-06 23:17:01,226 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 22 states. [2019-10-06 23:17:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:02,168 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2019-10-06 23:17:02,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-06 23:17:02,169 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-10-06 23:17:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:02,170 INFO L225 Difference]: With dead ends: 60 [2019-10-06 23:17:02,170 INFO L226 Difference]: Without dead ends: 42 [2019-10-06 23:17:02,172 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=484, Invalid=1868, Unknown=0, NotChecked=0, Total=2352 [2019-10-06 23:17:02,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-06 23:17:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-10-06 23:17:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-06 23:17:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-06 23:17:02,182 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 22 [2019-10-06 23:17:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:02,182 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-06 23:17:02,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-06 23:17:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-06 23:17:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-06 23:17:02,183 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:02,184 INFO L385 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:02,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:02,396 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:02,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:02,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1055620890, now seen corresponding path program 3 times [2019-10-06 23:17:02,397 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:02,397 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:02,397 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:02,397 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:02,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-06 23:17:02,588 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:02,588 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:02,589 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:02,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:17:02,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:17:02,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:17:02,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-06 23:17:02,717 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-06 23:17:02,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:02,916 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:17:02,917 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:02,917 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:02,917 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:02,918 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:02,957 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:17:03,074 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:03,090 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:17:03,095 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:03,096 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:03,096 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 141#(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:03,097 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 146#(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:03,098 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:17:03,098 INFO L193 IcfgInterpreter]: Reachable states at location L26-2 satisfy 121#(<= 2 main_~i~0) [2019-10-06 23:17:03,098 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 126#(and (<= 2 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:03,098 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:03,102 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:03,103 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(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:03,103 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:03,103 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:03,104 INFO L193 IcfgInterpreter]: Reachable states at location L40 satisfy 131#(and (< main_~x~0 100000) (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~x~0) |main_~#array~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:03,104 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(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:17:03,104 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:17:03,429 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:03,429 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 36 [2019-10-06 23:17:03,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-06 23:17:03,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-06 23:17:03,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=906, Unknown=0, NotChecked=0, Total=1260 [2019-10-06 23:17:03,432 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 36 states. [2019-10-06 23:17:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:05,299 INFO L93 Difference]: Finished difference Result 92 states and 126 transitions. [2019-10-06 23:17:05,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-06 23:17:05,299 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 32 [2019-10-06 23:17:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:05,301 INFO L225 Difference]: With dead ends: 92 [2019-10-06 23:17:05,301 INFO L226 Difference]: Without dead ends: 68 [2019-10-06 23:17:05,305 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2223 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1903, Invalid=5929, Unknown=0, NotChecked=0, Total=7832 [2019-10-06 23:17:05,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-06 23:17:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-06 23:17:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-06 23:17:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-06 23:17:05,317 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 32 [2019-10-06 23:17:05,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:05,317 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-06 23:17:05,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-06 23:17:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-06 23:17:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-06 23:17:05,319 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:05,319 INFO L385 BasicCegarLoop]: trace histogram [24, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:05,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:05,523 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:05,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:05,524 INFO L82 PathProgramCache]: Analyzing trace with hash -171811398, now seen corresponding path program 4 times [2019-10-06 23:17:05,525 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:05,525 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:05,525 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:05,525 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:05,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-06 23:17:05,908 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:05,908 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:05,908 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:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:06,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-06 23:17:06,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-06 23:17:06,082 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-06 23:17:06,956 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:06,958 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:17:06,958 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:06,958 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:06,959 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:06,959 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:06,981 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:17:07,070 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:07,091 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:17:07,095 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:07,095 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:07,095 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 141#(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:07,096 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 146#(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:07,096 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:17:07,096 INFO L193 IcfgInterpreter]: Reachable states at location L26-2 satisfy 121#(<= 2 main_~i~0) [2019-10-06 23:17:07,097 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 126#(and (<= 2 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:07,097 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:07,097 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:07,097 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(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:07,098 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:07,098 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:07,098 INFO L193 IcfgInterpreter]: Reachable states at location L40 satisfy 131#(and (< main_~x~0 100000) (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~x~0) |main_~#array~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:07,098 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(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:07,098 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:17:07,486 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:07,486 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27, 27, 11] total 62 [2019-10-06 23:17:07,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-06 23:17:07,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-06 23:17:07,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1355, Invalid=2427, Unknown=0, NotChecked=0, Total=3782 [2019-10-06 23:17:07,492 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 62 states. [2019-10-06 23:17:12,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:12,677 INFO L93 Difference]: Finished difference Result 156 states and 216 transitions. [2019-10-06 23:17:12,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-10-06 23:17:12,680 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 58 [2019-10-06 23:17:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:12,682 INFO L225 Difference]: With dead ends: 156 [2019-10-06 23:17:12,682 INFO L226 Difference]: Without dead ends: 120 [2019-10-06 23:17:12,689 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7629 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7779, Invalid=19943, Unknown=0, NotChecked=0, Total=27722 [2019-10-06 23:17:12,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-06 23:17:12,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2019-10-06 23:17:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-06 23:17:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2019-10-06 23:17:12,703 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 58 [2019-10-06 23:17:12,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:12,704 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2019-10-06 23:17:12,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-06 23:17:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2019-10-06 23:17:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-06 23:17:12,707 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:12,707 INFO L385 BasicCegarLoop]: trace histogram [50, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:12,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:12,910 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:12,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:12,910 INFO L82 PathProgramCache]: Analyzing trace with hash 214185690, now seen corresponding path program 5 times [2019-10-06 23:17:12,911 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:12,911 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:12,911 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:12,912 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:12,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-10-06 23:17:14,046 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:14,046 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:14,046 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:17:34,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-10-06 23:17:34,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:17:34,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-06 23:17:34,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-10-06 23:17:34,311 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:36,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-10-06 23:17:36,971 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:36,973 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:17:36,973 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:36,973 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:36,973 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:36,973 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:37,000 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:17:37,074 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:37,085 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:17:37,088 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:37,088 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:37,088 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 141#(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:37,088 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 146#(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:37,089 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:17:37,089 INFO L193 IcfgInterpreter]: Reachable states at location L26-2 satisfy 121#(<= 2 main_~i~0) [2019-10-06 23:17:37,089 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 126#(and (<= 2 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:37,089 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:37,089 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:17:37,090 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(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:37,090 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:37,090 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:37,090 INFO L193 IcfgInterpreter]: Reachable states at location L40 satisfy 131#(and (< main_~x~0 100000) (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~x~0) |main_~#array~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:37,090 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(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:17:37,091 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:17:37,587 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:37,587 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51, 11] total 110 [2019-10-06 23:17:37,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-10-06 23:17:37,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-10-06 23:17:37,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4979, Invalid=7011, Unknown=0, NotChecked=0, Total=11990 [2019-10-06 23:17:37,593 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand 110 states. [2019-10-06 23:17:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:52,596 INFO L93 Difference]: Finished difference Result 280 states and 386 transitions. [2019-10-06 23:17:52,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2019-10-06 23:17:52,597 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-10-06 23:17:52,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:52,599 INFO L225 Difference]: With dead ends: 280 [2019-10-06 23:17:52,599 INFO L226 Difference]: Without dead ends: 218 [2019-10-06 23:17:52,608 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25156 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=29876, Invalid=67780, Unknown=0, NotChecked=0, Total=97656 [2019-10-06 23:17:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-06 23:17:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2019-10-06 23:17:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-06 23:17:52,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 220 transitions. [2019-10-06 23:17:52,632 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 220 transitions. Word has length 110 [2019-10-06 23:17:52,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:52,632 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 220 transitions. [2019-10-06 23:17:52,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-10-06 23:17:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 220 transitions. [2019-10-06 23:17:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-06 23:17:52,636 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:52,636 INFO L385 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:52,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:52,838 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:52,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:52,839 INFO L82 PathProgramCache]: Analyzing trace with hash -326383974, now seen corresponding path program 6 times [2019-10-06 23:17:52,839 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:52,839 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:52,839 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:52,840 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:52,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-10-06 23:17:56,734 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:56,735 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:56,735 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:17:57,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:17:57,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:17:57,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 100 conjunts are in the unsatisfiable core [2019-10-06 23:17:57,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-10-06 23:17:57,112 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-10-06 23:18:07,082 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:07,084 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:18:07,085 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:07,085 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:07,085 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:07,085 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:07,128 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:07,208 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:18:07,218 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:07,221 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:07,222 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:07,222 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 141#(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,222 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 146#(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,222 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:07,222 INFO L193 IcfgInterpreter]: Reachable states at location L26-2 satisfy 121#(<= 2 main_~i~0) [2019-10-06 23:18:07,223 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 126#(and (<= 2 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,223 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,223 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:07,223 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(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,224 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:07,224 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:07,225 INFO L193 IcfgInterpreter]: Reachable states at location L40 satisfy 131#(and (< main_~x~0 100000) (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~x~0) |main_~#array~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:07,225 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(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:07,225 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:18:07,937 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:07,937 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101, 11] total 212 [2019-10-06 23:18:07,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 212 states [2019-10-06 23:18:07,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2019-10-06 23:18:07,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20330, Invalid=24402, Unknown=0, NotChecked=0, Total=44732 [2019-10-06 23:18:07,946 INFO L87 Difference]: Start difference. First operand 216 states and 220 transitions. Second operand 212 states. [2019-10-06 23:19:02,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:19:02,624 INFO L93 Difference]: Finished difference Result 532 states and 742 transitions. [2019-10-06 23:19:02,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 410 states. [2019-10-06 23:19:02,624 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 208 [2019-10-06 23:19:02,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:19:02,628 INFO L225 Difference]: With dead ends: 532 [2019-10-06 23:19:02,629 INFO L226 Difference]: Without dead ends: 420 [2019-10-06 23:19:02,641 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1129 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 615 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97791 ImplicationChecksByTransitivity, 60.6s TimeCoverageRelationStatistics Valid=120879, Invalid=259193, Unknown=0, NotChecked=0, Total=380072 [2019-10-06 23:19:02,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-10-06 23:19:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 418. [2019-10-06 23:19:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-10-06 23:19:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 422 transitions. [2019-10-06 23:19:02,687 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 422 transitions. Word has length 208 [2019-10-06 23:19:02,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:19:02,688 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 422 transitions. [2019-10-06 23:19:02,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 212 states. [2019-10-06 23:19:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 422 transitions. [2019-10-06 23:19:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-10-06 23:19:02,695 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:19:02,696 INFO L385 BasicCegarLoop]: trace histogram [200, 198, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:19:02,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:19:02,901 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:19:02,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:19:02,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1599433914, now seen corresponding path program 7 times [2019-10-06 23:19:02,902 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:19:02,902 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:19:02,903 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:19:02,903 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:19:02,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:19:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:19:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 39801 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 20100 trivial. 0 not checked. [2019-10-06 23:19:17,951 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:19:17,951 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:19:17,951 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:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:19:18,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 202 conjunts are in the unsatisfiable core [2019-10-06 23:19:18,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:19:18,629 INFO L134 CoverageAnalysis]: Checked inductivity of 39801 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 19701 trivial. 0 not checked. [2019-10-06 23:19:18,630 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:20:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 39801 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 19701 trivial. 0 not checked. [2019-10-06 23:20:00,411 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:20:00,412 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:20:00,413 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:20:00,413 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:20:00,413 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:20:00,413 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:20:00,430 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:20:00,493 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:20:00,501 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:20:00,504 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:20:00,504 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:20:00,504 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 141#(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:20:00,505 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 146#(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:20:00,505 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:20:00,505 INFO L193 IcfgInterpreter]: Reachable states at location L26-2 satisfy 121#(<= 2 main_~i~0) [2019-10-06 23:20:00,505 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 126#(and (<= 2 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:20:00,505 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(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:20:00,506 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:20:00,506 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:20:00,506 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:20:00,506 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:20:00,506 INFO L193 IcfgInterpreter]: Reachable states at location L40 satisfy 131#(and (< main_~x~0 100000) (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~x~0) |main_~#array~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:20:00,506 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(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:20:00,507 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:20:01,686 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:20:01,687 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [201, 203, 203, 11] total 414 [2019-10-06 23:20:01,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 414 states [2019-10-06 23:20:01,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 414 interpolants. [2019-10-06 23:20:01,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81435, Invalid=89547, Unknown=0, NotChecked=0, Total=170982 [2019-10-06 23:20:01,702 INFO L87 Difference]: Start difference. First operand 418 states and 422 transitions. Second operand 414 states. [2019-10-06 23:24:15,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:24:15,342 INFO L93 Difference]: Finished difference Result 1036 states and 1448 transitions. [2019-10-06 23:24:15,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 814 states. [2019-10-06 23:24:15,342 INFO L78 Accepts]: Start accepts. Automaton has 414 states. Word has length 410 [2019-10-06 23:24:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:24:15,348 INFO L225 Difference]: With dead ends: 1036 [2019-10-06 23:24:15,349 INFO L226 Difference]: Without dead ends: 824 [2019-10-06 23:24:15,385 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2239 GetRequests, 1018 SyntacticMatches, 0 SemanticMatches, 1221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379693 ImplicationChecksByTransitivity, 235.4s TimeCoverageRelationStatistics Valid=486499, Invalid=1008007, Unknown=0, NotChecked=0, Total=1494506 [2019-10-06 23:24:15,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-10-06 23:24:15,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 822. [2019-10-06 23:24:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-10-06 23:24:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 826 transitions. [2019-10-06 23:24:15,423 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 826 transitions. Word has length 410 [2019-10-06 23:24:15,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:24:15,424 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 826 transitions. [2019-10-06 23:24:15,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 414 states. [2019-10-06 23:24:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 826 transitions. [2019-10-06 23:24:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2019-10-06 23:24:15,448 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:24:15,449 INFO L385 BasicCegarLoop]: trace histogram [402, 400, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:24:15,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:24:15,655 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:24:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:24:15,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2019437350, now seen corresponding path program 8 times [2019-10-06 23:24:15,656 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:24:15,657 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:24:15,657 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:24:15,657 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:24:15,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:24:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 161203 backedges. 0 proven. 80200 refuted. 0 times theorem prover too weak. 81003 trivial. 0 not checked. [2019-10-06 23:25:14,393 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:14,394 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:25:14,394 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