java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_init2_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:55:38,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:55:38,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:55:38,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:55:38,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:55:38,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:55:38,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:55:38,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:55:38,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:55:38,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:55:38,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:55:38,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:55:38,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:55:38,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:55:38,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:55:38,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:55:38,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:55:38,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:55:38,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:55:38,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:55:38,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:55:38,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:55:38,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:55:38,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:55:38,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:55:38,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:55:38,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:55:38,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:55:38,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:55:38,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:55:38,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:55:38,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:55:38,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:55:38,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:55:38,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:55:38,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:55:38,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:55:38,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:55:38,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:55:38,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:55:38,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:55:38,393 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:55:38,411 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:55:38,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:55:38,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:55:38,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:55:38,413 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:55:38,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:55:38,414 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:55:38,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:55:38,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:55:38,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:55:38,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:55:38,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:55:38,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:55:38,415 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:55:38,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:55:38,416 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:55:38,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:55:38,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:55:38,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:55:38,416 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:55:38,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:55:38,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:55:38,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:55:38,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:55:38,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:55:38,418 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:55:38,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:55:38,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:55:38,418 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:55:38,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:55:38,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:55:38,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:55:38,721 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:55:38,722 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:55:38,722 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init2_ground-1.i [2019-10-06 23:55:38,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d81774e4f/3388dfb9d38f4a9fbc65909a078a8119/FLAG8f7c8f8f3 [2019-10-06 23:55:39,272 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:55:39,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init2_ground-1.i [2019-10-06 23:55:39,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d81774e4f/3388dfb9d38f4a9fbc65909a078a8119/FLAG8f7c8f8f3 [2019-10-06 23:55:39,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d81774e4f/3388dfb9d38f4a9fbc65909a078a8119 [2019-10-06 23:55:39,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:55:39,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:55:39,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:55:39,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:55:39,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:55:39,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:55:39" (1/1) ... [2019-10-06 23:55:39,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52da3fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:55:39, skipping insertion in model container [2019-10-06 23:55:39,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:55:39" (1/1) ... [2019-10-06 23:55:39,658 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:55:39,677 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:55:39,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:55:39,934 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:55:39,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:55:39,974 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:55:39,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:55:39 WrapperNode [2019-10-06 23:55:39,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:55:39,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:55:39,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:55:39,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:55:40,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:55:39" (1/1) ... [2019-10-06 23:55:40,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:55:39" (1/1) ... [2019-10-06 23:55:40,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:55:39" (1/1) ... [2019-10-06 23:55:40,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:55:39" (1/1) ... [2019-10-06 23:55:40,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:55:39" (1/1) ... [2019-10-06 23:55:40,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:55:39" (1/1) ... [2019-10-06 23:55:40,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:55:39" (1/1) ... [2019-10-06 23:55:40,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:55:40,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:55:40,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:55:40,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:55:40,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:55:39" (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:55:40,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:55:40,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:55:40,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:55:40,196 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:55:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:55:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:55:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:55:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:55:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:55:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:55:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:55:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:55:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:55:40,534 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:55:40,535 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-06 23:55:40,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:55:40 BoogieIcfgContainer [2019-10-06 23:55:40,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:55:40,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:55:40,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:55:40,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:55:40,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:55:39" (1/3) ... [2019-10-06 23:55:40,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed5a4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:55:40, skipping insertion in model container [2019-10-06 23:55:40,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:55:39" (2/3) ... [2019-10-06 23:55:40,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed5a4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:55:40, skipping insertion in model container [2019-10-06 23:55:40,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:55:40" (3/3) ... [2019-10-06 23:55:40,544 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_init2_ground-1.i [2019-10-06 23:55:40,553 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:55:40,561 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:55:40,571 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:55:40,598 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:55:40,599 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:55:40,599 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:55:40,599 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:55:40,599 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:55:40,600 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:55:40,600 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:55:40,600 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:55:40,618 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-06 23:55:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-06 23:55:40,624 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:55:40,625 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:55:40,627 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:55:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:55:40,632 INFO L82 PathProgramCache]: Analyzing trace with hash 205655519, now seen corresponding path program 1 times [2019-10-06 23:55:40,640 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:55:40,640 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:40,641 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:40,641 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:40,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:55:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:55:40,883 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:55:40,885 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:40,886 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:55:40,887 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:55:40,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:55:40,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:55:40,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:55:40,916 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-06 23:55:41,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:55:41,014 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-10-06 23:55:41,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:55:41,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-06 23:55:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:55:41,029 INFO L225 Difference]: With dead ends: 34 [2019-10-06 23:55:41,030 INFO L226 Difference]: Without dead ends: 18 [2019-10-06 23:55:41,036 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:55:41,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-06 23:55:41,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-06 23:55:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-06 23:55:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-06 23:55:41,093 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2019-10-06 23:55:41,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:55:41,094 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-06 23:55:41,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:55:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-06 23:55:41,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:55:41,097 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:55:41,098 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:55:41,098 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:55:41,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:55:41,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1509760332, now seen corresponding path program 1 times [2019-10-06 23:55:41,100 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:55:41,101 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:41,101 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:41,101 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:41,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:55:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:55:41,209 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:55:41,210 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:41,210 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:55:41,210 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:55:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:55:41,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:55:41,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:55:41,318 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:55:41,318 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:55:41,359 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:55:41,360 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:55:41,389 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:55:41,389 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:55:41,397 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:55:41,406 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:55:41,407 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:55:41,639 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:55:42,251 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-06 23:55:42,276 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:55:42,288 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:55:42,289 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:55:42,289 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 129#(and (exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_1) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:55:42,289 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_1) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:55:42,290 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:55:42,291 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 114#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:55:42,291 INFO L193 IcfgInterpreter]: Reachable states at location L6-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:55:42,292 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:55:42,292 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:55:42,293 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(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:55:42,293 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 119#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem1|) (< main_~x~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:55:42,293 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_1) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:55:42,294 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:55:42,295 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_1) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-06 23:55:42,295 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 109#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:55:42,816 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:55:42,816 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 10] total 17 [2019-10-06 23:55:42,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:55:42,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:55:42,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-06 23:55:42,821 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 17 states. [2019-10-06 23:55:43,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:55:43,617 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-10-06 23:55:43,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-06 23:55:43,618 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-10-06 23:55:43,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:55:43,620 INFO L225 Difference]: With dead ends: 44 [2019-10-06 23:55:43,620 INFO L226 Difference]: Without dead ends: 33 [2019-10-06 23:55:43,627 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:55:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-06 23:55:43,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-10-06 23:55:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-06 23:55:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-06 23:55:43,639 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-06 23:55:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:55:43,640 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-06 23:55:43,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:55:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-06 23:55:43,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-06 23:55:43,646 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:55:43,647 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:55:43,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:55:43,852 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:55:43,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:55:43,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1450262815, now seen corresponding path program 2 times [2019-10-06 23:55:43,853 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:55:43,853 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:43,853 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:43,853 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:43,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:55:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:55:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:55:43,962 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:43,962 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:55:43,962 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:55:44,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:55:44,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:55:44,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:55:44,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:55:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:55:44,056 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:55:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:55:44,133 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:55:44,135 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:55:44,136 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:55:44,137 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:55:44,138 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:55:44,138 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:55:44,200 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:55:44,585 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-06 23:55:44,605 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:55:44,624 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:55:44,625 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:55:44,626 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 129#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= 42 (select (select |#memory_int| v_prenex_2) 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:55:44,626 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 134#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= 42 (select (select |#memory_int| v_prenex_2) 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:55:44,627 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:55:44,627 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 114#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:55:44,627 INFO L193 IcfgInterpreter]: Reachable states at location L6-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:55:44,628 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:55:44,628 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:55:44,628 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(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:55:44,628 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 119#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem1|) (< main_~x~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:55:44,629 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= 42 (select (select |#memory_int| v_prenex_2) 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:55:44,633 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:55:44,634 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= 42 (select (select |#memory_int| v_prenex_2) 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-06 23:55:44,634 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 109#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:55:45,144 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:55:45,144 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 10] total 23 [2019-10-06 23:55:45,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-06 23:55:45,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-06 23:55:45,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-10-06 23:55:45,146 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 23 states. [2019-10-06 23:55:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:55:46,079 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2019-10-06 23:55:46,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-06 23:55:46,079 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2019-10-06 23:55:46,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:55:46,081 INFO L225 Difference]: With dead ends: 59 [2019-10-06 23:55:46,081 INFO L226 Difference]: Without dead ends: 45 [2019-10-06 23:55:46,083 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=312, Invalid=1248, Unknown=0, NotChecked=0, Total=1560 [2019-10-06 23:55:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-06 23:55:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2019-10-06 23:55:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-06 23:55:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-06 23:55:46,094 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2019-10-06 23:55:46,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:55:46,094 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-06 23:55:46,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-06 23:55:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-10-06 23:55:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-06 23:55:46,096 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:55:46,096 INFO L385 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:55:46,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:55:46,306 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:55:46,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:55:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash 807641599, now seen corresponding path program 3 times [2019-10-06 23:55:46,306 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:55:46,306 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:46,306 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:46,306 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:46,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:55:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:55:46,470 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:55:46,470 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:46,471 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:55:46,471 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:55:46,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:55:46,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:55:46,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:55:46,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:55:46,565 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:55:46,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:55:46,755 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:55:46,755 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:55:46,757 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:55:46,757 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:55:46,757 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:55:46,758 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:55:46,758 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:55:46,784 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:55:47,049 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-06 23:55:47,059 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:55:47,064 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:55:47,064 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:55:47,064 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 129#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_3) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:55:47,065 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_3) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:55:47,065 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:55:47,065 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 114#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:55:47,065 INFO L193 IcfgInterpreter]: Reachable states at location L6-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:55:47,066 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:55:47,066 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:55:47,066 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(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:55:47,066 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 119#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem1|) (< main_~x~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:55:47,067 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_3) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:55:47,067 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:55:47,067 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_3) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-06 23:55:47,067 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 109#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:55:47,712 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:55:47,713 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 10] total 35 [2019-10-06 23:55:47,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-06 23:55:47,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-06 23:55:47,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-06 23:55:47,716 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 35 states. [2019-10-06 23:55:49,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:55:49,358 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2019-10-06 23:55:49,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-06 23:55:49,359 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 32 [2019-10-06 23:55:49,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:55:49,362 INFO L225 Difference]: With dead ends: 89 [2019-10-06 23:55:49,362 INFO L226 Difference]: Without dead ends: 69 [2019-10-06 23:55:49,364 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 65 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1392 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=978, Invalid=3054, Unknown=0, NotChecked=0, Total=4032 [2019-10-06 23:55:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-06 23:55:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-10-06 23:55:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-06 23:55:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-06 23:55:49,376 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 32 [2019-10-06 23:55:49,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:55:49,377 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-06 23:55:49,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-06 23:55:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-06 23:55:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-06 23:55:49,379 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:55:49,379 INFO L385 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:55:49,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:55:49,586 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:55:49,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:55:49,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1094079553, now seen corresponding path program 4 times [2019-10-06 23:55:49,587 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:55:49,587 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:49,587 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:49,587 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:49,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:55:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:55:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-06 23:55:50,027 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:50,027 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:55:50,028 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:55:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:55:50,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-06 23:55:50,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:55:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-06 23:55:50,148 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:55:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-06 23:55:50,907 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:55:50,909 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:55:50,909 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:55:50,909 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:55:50,910 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:55:50,910 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:55:50,954 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:55:51,162 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-06 23:55:51,169 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:55:51,172 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:55:51,173 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:55:51,173 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 129#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_4) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:55:51,173 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_4) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:55:51,174 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:55:51,174 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 114#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:55:51,174 INFO L193 IcfgInterpreter]: Reachable states at location L6-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:55:51,174 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:55:51,174 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:55:51,175 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(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:55:51,175 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 119#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem1|) (< main_~x~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:55:51,175 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_4) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:55:51,175 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:55:51,176 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_4) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-06 23:55:51,176 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 109#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:55:52,121 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:55:52,121 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 10] total 59 [2019-10-06 23:55:52,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-06 23:55:52,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-06 23:55:52,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1205, Invalid=2217, Unknown=0, NotChecked=0, Total=3422 [2019-10-06 23:55:52,125 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 59 states. [2019-10-06 23:55:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:55:55,832 INFO L93 Difference]: Finished difference Result 149 states and 200 transitions. [2019-10-06 23:55:55,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-06 23:55:55,833 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 56 [2019-10-06 23:55:55,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:55:55,834 INFO L225 Difference]: With dead ends: 149 [2019-10-06 23:55:55,835 INFO L226 Difference]: Without dead ends: 117 [2019-10-06 23:55:55,838 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 113 SyntacticMatches, 23 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4386 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3606, Invalid=8826, Unknown=0, NotChecked=0, Total=12432 [2019-10-06 23:55:55,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-06 23:55:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-10-06 23:55:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-06 23:55:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-10-06 23:55:55,858 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 56 [2019-10-06 23:55:55,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:55:55,858 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-10-06 23:55:55,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-06 23:55:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-10-06 23:55:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-06 23:55:55,861 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:55:55,862 INFO L385 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:55:56,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:55:56,077 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:55:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:55:56,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1805836095, now seen corresponding path program 5 times [2019-10-06 23:55:56,078 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:55:56,078 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:56,078 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:56,078 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:56,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:55:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:55:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-06 23:55:57,181 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:57,181 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:55:57,181 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:58:30,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-06 23:58:30,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:58:30,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-06 23:58:30,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:58:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-06 23:58:30,090 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:58:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-06 23:58:32,505 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:58:32,507 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:58:32,507 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:58:32,507 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:58:32,508 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:58:32,508 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:58:32,533 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:58:32,702 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-06 23:58:32,723 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:58:32,726 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:58:32,726 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:58:32,726 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 129#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) 42)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_5) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:58:32,727 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) 42)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_5) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:58:32,727 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:58:32,727 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 114#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:58:32,728 INFO L193 IcfgInterpreter]: Reachable states at location L6-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:58:32,728 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:58:32,728 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:58:32,728 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:58:32,729 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) 42)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_5) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:58:32,730 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 119#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem1|) (< main_~x~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:58:32,730 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:58:32,730 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) 42)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_5) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-06 23:58:32,730 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 109#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:58:34,714 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:58:34,714 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49, 10] total 107 [2019-10-06 23:58:34,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-10-06 23:58:34,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-10-06 23:58:34,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4685, Invalid=6657, Unknown=0, NotChecked=0, Total=11342 [2019-10-06 23:58:34,720 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 107 states. [2019-10-06 23:58:44,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:58:44,943 INFO L93 Difference]: Finished difference Result 269 states and 368 transitions. [2019-10-06 23:58:44,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-10-06 23:58:44,946 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 104 [2019-10-06 23:58:44,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:58:44,948 INFO L225 Difference]: With dead ends: 269 [2019-10-06 23:58:44,948 INFO L226 Difference]: Without dead ends: 213 [2019-10-06 23:58:44,956 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 304 SyntacticMatches, 47 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15126 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=14046, Invalid=29010, Unknown=0, NotChecked=0, Total=43056 [2019-10-06 23:58:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-06 23:58:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 204. [2019-10-06 23:58:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-10-06 23:58:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 206 transitions. [2019-10-06 23:58:44,981 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 206 transitions. Word has length 104 [2019-10-06 23:58:44,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:58:44,981 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 206 transitions. [2019-10-06 23:58:44,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-10-06 23:58:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 206 transitions. [2019-10-06 23:58:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-06 23:58:44,985 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:58:44,986 INFO L385 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:58:45,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:58:45,187 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:58:45,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:58:45,188 INFO L82 PathProgramCache]: Analyzing trace with hash 600426047, now seen corresponding path program 6 times [2019-10-06 23:58:45,188 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:58:45,188 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:58:45,188 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:58:45,189 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:58:45,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:58:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:58:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-10-06 23:58:48,954 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:58:48,954 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:58:48,954 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:58:49,157 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:58:49,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:58:49,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-06 23:58:49,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:58:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-10-06 23:58:49,244 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:58:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-10-06 23:58:58,837 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:58:58,838 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:58:58,839 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:58:58,839 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:58:58,839 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:58:58,840 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:58:58,861 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:58:59,046 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-06 23:58:59,053 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:58:59,058 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:58:59,059 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:58:59,059 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 129#(and (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_6) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:58:59,059 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_6) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:58:59,059 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:58:59,060 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 114#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:58:59,060 INFO L193 IcfgInterpreter]: Reachable states at location L6-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:58:59,060 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:58:59,060 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:58:59,060 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:58:59,061 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_6) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:58:59,061 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 119#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem1|) (< main_~x~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:58:59,061 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:58:59,061 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_6) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-06 23:58:59,062 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 109#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:59:05,020 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:59:05,020 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97, 10] total 203 [2019-10-06 23:59:05,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 203 states [2019-10-06 23:59:05,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2019-10-06 23:59:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18557, Invalid=22449, Unknown=0, NotChecked=0, Total=41006 [2019-10-06 23:59:05,027 INFO L87 Difference]: Start difference. First operand 204 states and 206 transitions. Second operand 203 states. [2019-10-06 23:59:39,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:59:39,436 INFO L93 Difference]: Finished difference Result 509 states and 704 transitions. [2019-10-06 23:59:39,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2019-10-06 23:59:39,437 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 200 [2019-10-06 23:59:39,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:59:39,445 INFO L225 Difference]: With dead ends: 509 [2019-10-06 23:59:39,445 INFO L226 Difference]: Without dead ends: 405 [2019-10-06 23:59:39,451 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 894 GetRequests, 401 SyntacticMatches, 95 SemanticMatches, 398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55614 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=55662, Invalid=103938, Unknown=0, NotChecked=0, Total=159600 [2019-10-06 23:59:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-10-06 23:59:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 396. [2019-10-06 23:59:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-10-06 23:59:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 398 transitions. [2019-10-06 23:59:39,512 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 398 transitions. Word has length 200 [2019-10-06 23:59:39,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:59:39,513 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 398 transitions. [2019-10-06 23:59:39,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 203 states. [2019-10-06 23:59:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 398 transitions. [2019-10-06 23:59:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-10-06 23:59:39,525 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:59:39,525 INFO L385 BasicCegarLoop]: trace histogram [190, 190, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:59:39,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:59:39,730 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:59:39,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:59:39,730 INFO L82 PathProgramCache]: Analyzing trace with hash -806775745, now seen corresponding path program 7 times [2019-10-06 23:59:39,730 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:59:39,730 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:59:39,730 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:59:39,731 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:59:39,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:59:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:59:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2019-10-06 23:59:53,347 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:59:53,347 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:59:53,347 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:59:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:59:53,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 1574 conjuncts, 192 conjunts are in the unsatisfiable core [2019-10-06 23:59:53,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:59:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2019-10-06 23:59:53,860 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:00:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2019-10-07 00:00:33,330 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:00:33,332 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:00:33,332 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:00:33,333 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:00:33,333 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:00:33,333 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:00:33,372 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:00:33,558 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:00:33,563 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:00:33,565 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:00:33,565 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:00:33,565 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 129#(and (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) 42))) (and (= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_7) 0) 42) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:00:33,566 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 134#(and (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) 42))) (and (= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_7) 0) 42) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:00:33,566 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:00:33,566 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 114#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:00:33,566 INFO L193 IcfgInterpreter]: Reachable states at location L6-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0) (= main_~i~0 0))) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:00:33,566 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:00:33,566 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:00:33,566 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:00:33,567 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) 42))) (and (= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_7) 0) 42) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:00:33,567 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 119#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem1|) (< main_~x~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:00:33,567 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:00:33,567 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) 42))) (and (= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_7) 0) 42) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:00:33,567 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 109#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:00:53,884 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:00:53,885 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 193, 193, 10] total 395 [2019-10-07 00:00:53,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 395 states [2019-10-07 00:00:53,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 395 interpolants. [2019-10-07 00:00:53,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73949, Invalid=81681, Unknown=0, NotChecked=0, Total=155630 [2019-10-07 00:00:53,900 INFO L87 Difference]: Start difference. First operand 396 states and 398 transitions. Second operand 395 states. [2019-10-07 00:03:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:03:54,371 INFO L93 Difference]: Finished difference Result 989 states and 1376 transitions. [2019-10-07 00:03:54,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 394 states. [2019-10-07 00:03:54,371 INFO L78 Accepts]: Start accepts. Automaton has 395 states. Word has length 392 [2019-10-07 00:03:54,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:03:54,381 INFO L225 Difference]: With dead ends: 989 [2019-10-07 00:03:54,381 INFO L226 Difference]: Without dead ends: 789 [2019-10-07 00:03:54,394 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1758 GetRequests, 785 SyntacticMatches, 191 SemanticMatches, 782 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212622 ImplicationChecksByTransitivity, 163.9s TimeCoverageRelationStatistics Valid=221838, Invalid=392034, Unknown=0, NotChecked=0, Total=613872 [2019-10-07 00:03:54,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-10-07 00:03:54,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 780. [2019-10-07 00:03:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-10-07 00:03:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 782 transitions. [2019-10-07 00:03:54,438 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 782 transitions. Word has length 392 [2019-10-07 00:03:54,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:03:54,439 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 782 transitions. [2019-10-07 00:03:54,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 395 states. [2019-10-07 00:03:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 782 transitions. [2019-10-07 00:03:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 777 [2019-10-07 00:03:54,464 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:03:54,464 INFO L385 BasicCegarLoop]: trace histogram [382, 382, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:03:54,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:03:54,675 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:03:54,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:03:54,677 INFO L82 PathProgramCache]: Analyzing trace with hash 661729343, now seen corresponding path program 8 times [2019-10-07 00:03:54,677 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:03:54,677 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:03:54,677 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:03:54,678 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:03:54,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:03:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:04:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 146306 backedges. 0 proven. 73153 refuted. 0 times theorem prover too weak. 73153 trivial. 0 not checked. [2019-10-07 00:04:48,786 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:04:48,786 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:04:48,786 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