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_sentinel.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:22:36,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:22:36,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:22:36,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:22:36,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:22:36,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:22:36,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:22:36,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:22:36,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:22:36,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:22:36,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:22:36,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:22:36,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:22:36,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:22:36,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:22:36,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:22:36,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:22:36,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:22:36,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:22:36,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:22:36,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:22:36,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:22:36,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:22:36,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:22:36,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:22:36,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:22:36,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:22:36,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:22:36,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:22:36,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:22:36,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:22:36,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:22:36,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:22:36,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:22:36,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:22:36,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:22:36,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:22:36,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:22:36,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:22:36,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:22:36,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:22:36,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:22:36,579 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:22:36,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:22:36,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:22:36,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:22:36,582 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:22:36,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:22:36,583 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:22:36,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:22:36,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:22:36,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:22:36,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:22:36,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:22:36,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:22:36,586 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:22:36,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:22:36,586 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:22:36,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:22:36,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:22:36,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:22:36,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:22:36,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:22:36,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:22:36,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:22:36,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:22:36,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:22:36,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:22:36,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:22:36,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:22:36,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:22:36,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:22:36,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:22:36,953 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:22:36,955 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:22:36,955 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:22:36,956 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c [2019-10-07 00:22:37,036 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3603c7004/f82115b2b0d94e31be9912fbed048840/FLAG9de134ec5 [2019-10-07 00:22:37,507 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:22:37,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c [2019-10-07 00:22:37,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3603c7004/f82115b2b0d94e31be9912fbed048840/FLAG9de134ec5 [2019-10-07 00:22:37,870 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3603c7004/f82115b2b0d94e31be9912fbed048840 [2019-10-07 00:22:37,882 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:22:37,884 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:22:37,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:22:37,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:22:37,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:22:37,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:22:37" (1/1) ... [2019-10-07 00:22:37,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a94e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:22:37, skipping insertion in model container [2019-10-07 00:22:37,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:22:37" (1/1) ... [2019-10-07 00:22:37,897 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:22:37,915 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:22:38,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:22:38,164 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:22:38,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:22:38,207 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:22:38,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:22:38 WrapperNode [2019-10-07 00:22:38,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:22:38,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:22:38,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:22:38,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:22:38,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:22:38" (1/1) ... [2019-10-07 00:22:38,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:22:38" (1/1) ... [2019-10-07 00:22:38,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:22:38" (1/1) ... [2019-10-07 00:22:38,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:22:38" (1/1) ... [2019-10-07 00:22:38,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:22:38" (1/1) ... [2019-10-07 00:22:38,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:22:38" (1/1) ... [2019-10-07 00:22:38,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:22:38" (1/1) ... [2019-10-07 00:22:38,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:22:38,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:22:38,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:22:38,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:22:38,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:22:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:22:38,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:22:38,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:22:38,388 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:22:38,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:22:38,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:22:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:22:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:22:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:22:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:22:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:22:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:22:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:22:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:22:38,671 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:22:38,671 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:22:38,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:22:38 BoogieIcfgContainer [2019-10-07 00:22:38,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:22:38,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:22:38,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:22:38,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:22:38,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:22:37" (1/3) ... [2019-10-07 00:22:38,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fee00e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:22:38, skipping insertion in model container [2019-10-07 00:22:38,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:22:38" (2/3) ... [2019-10-07 00:22:38,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fee00e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:22:38, skipping insertion in model container [2019-10-07 00:22:38,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:22:38" (3/3) ... [2019-10-07 00:22:38,699 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_sentinel.i.v+cfa-reducer.c [2019-10-07 00:22:38,724 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:22:38,744 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:22:38,757 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:22:38,783 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:22:38,783 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:22:38,783 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:22:38,784 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:22:38,784 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:22:38,784 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:22:38,784 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:22:38,784 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:22:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-10-07 00:22:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:22:38,809 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:22:38,810 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:22:38,812 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:22:38,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:22:38,817 INFO L82 PathProgramCache]: Analyzing trace with hash 882124697, now seen corresponding path program 1 times [2019-10-07 00:22:38,824 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:22:38,825 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:38,825 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:38,825 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:38,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:22:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:22:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:22:39,012 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:39,013 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:22:39,015 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:22:39,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:22:39,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:22:39,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:22:39,036 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-10-07 00:22:39,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:22:39,063 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-10-07 00:22:39,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:22:39,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:22:39,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:22:39,076 INFO L225 Difference]: With dead ends: 29 [2019-10-07 00:22:39,077 INFO L226 Difference]: Without dead ends: 14 [2019-10-07 00:22:39,081 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:22:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-07 00:22:39,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-07 00:22:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-07 00:22:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-07 00:22:39,120 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-10-07 00:22:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:22:39,121 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-07 00:22:39,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:22:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-07 00:22:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:22:39,122 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:22:39,122 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:22:39,123 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:22:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:22:39,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1345624393, now seen corresponding path program 1 times [2019-10-07 00:22:39,124 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:22:39,124 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:39,124 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:39,124 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:39,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:22:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:22:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:22:39,235 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:39,236 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:22:39,236 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 00:22:39,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:22:39,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:22:39,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 00:22:39,241 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-10-07 00:22:39,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:22:39,318 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-10-07 00:22:39,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 00:22:39,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-07 00:22:39,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:22:39,322 INFO L225 Difference]: With dead ends: 19 [2019-10-07 00:22:39,322 INFO L226 Difference]: Without dead ends: 16 [2019-10-07 00:22:39,323 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:22:39,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-07 00:22:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-07 00:22:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-07 00:22:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-07 00:22:39,329 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-10-07 00:22:39,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:22:39,329 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-07 00:22:39,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:22:39,330 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-07 00:22:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 00:22:39,330 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:22:39,331 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:22:39,331 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:22:39,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:22:39,332 INFO L82 PathProgramCache]: Analyzing trace with hash 357797452, now seen corresponding path program 1 times [2019-10-07 00:22:39,332 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:22:39,332 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:39,332 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:39,332 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:39,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:22:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:22:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:22:39,432 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:39,432 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:22:39,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:22:39,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:22:39,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:22:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:22:39,540 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:22:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:22:39,577 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:22:39,604 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:22:39,605 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:22:39,612 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:22:39,621 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:22:39,622 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:22:39,873 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 29 for LOIs [2019-10-07 00:22:40,260 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:22:40,273 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:22:40,273 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:22:40,282 INFO L193 IcfgInterpreter]: Reachable states at location L15-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:22:40,282 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 78#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:40,282 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:22:40,283 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-07 00:22:40,284 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_60~0)| ~__return_60~0)) [2019-10-07 00:22:40,284 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:22:40,285 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~__return_60~0)|) (= |#valid| |old(#valid)|) (<= |old(~__return_60~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= |old(~__return_60~0)| ~__return_60~0) (= |old(#length)| |#length|) (= |old(~__return_60~0)| 0)) [2019-10-07 00:22:40,285 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem4|) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:40,285 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:22:40,286 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:22:40,289 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 129#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (= main_~__tmp_1~0 1) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (not (<= main_~main__i~0 main_~main__pos~0)) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (or (and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) (and (<= main_~main__pos~0 100000) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__i~0) (<= main_~__tmp_1~0 1) (<= 100000 main_~i~0) (<= 1 main_~__tmp_1~0) (<= 0 main_~main__pos~0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= main_~main__i~0 100000)))) [2019-10-07 00:22:40,289 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 119#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:40,290 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 134#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:22:40,732 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-10-07 00:22:40,834 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:22:40,834 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-07 00:22:40,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-07 00:22:40,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-07 00:22:40,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-10-07 00:22:40,837 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 17 states. [2019-10-07 00:22:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:22:41,363 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-10-07 00:22:41,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 00:22:41,364 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2019-10-07 00:22:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:22:41,365 INFO L225 Difference]: With dead ends: 28 [2019-10-07 00:22:41,365 INFO L226 Difference]: Without dead ends: 19 [2019-10-07 00:22:41,366 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-10-07 00:22:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-07 00:22:41,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-07 00:22:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-07 00:22:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-10-07 00:22:41,374 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2019-10-07 00:22:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:22:41,374 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-07 00:22:41,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-07 00:22:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-10-07 00:22:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 00:22:41,375 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:22:41,376 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:22:41,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:41,577 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:22:41,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:22:41,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1083919204, now seen corresponding path program 2 times [2019-10-07 00:22:41,578 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:22:41,578 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:41,578 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:41,578 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:41,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:22:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:22:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:22:41,659 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:41,659 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:22:41,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:41,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 00:22:41,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:22:41,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-07 00:22:41,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:22:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:22:41,913 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:22:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:22:42,031 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:22:42,032 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:22:42,033 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:22:42,034 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:22:42,034 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:22:42,035 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:22:42,106 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 31 for LOIs [2019-10-07 00:22:42,384 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:22:42,393 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:22:42,393 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:22:42,393 INFO L193 IcfgInterpreter]: Reachable states at location L15-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:22:42,393 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 78#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:42,394 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:22:42,394 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-07 00:22:42,394 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_60~0)| ~__return_60~0)) [2019-10-07 00:22:42,395 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:22:42,395 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~__return_60~0)|) (<= |old(~__return_60~0)| 0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= |old(~__return_60~0)| ~__return_60~0) (= |old(#length)| |#length|) (= |old(~__return_60~0)| 0)) [2019-10-07 00:22:42,395 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem4|) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:42,395 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:22:42,396 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:22:42,396 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 129#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (= main_~__tmp_1~0 1) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (not (<= main_~main__i~0 main_~main__pos~0)) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (or (and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) (and (<= main_~main__pos~0 100000) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__i~0) (<= main_~__tmp_1~0 1) (<= 100000 main_~i~0) (<= 1 main_~__tmp_1~0) (<= 0 main_~main__pos~0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= main_~main__i~0 100000)))) [2019-10-07 00:22:42,396 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 119#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:42,396 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 134#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:22:43,000 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-10-07 00:22:43,001 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:22:43,001 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 26 [2019-10-07 00:22:43,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-07 00:22:43,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-07 00:22:43,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2019-10-07 00:22:43,003 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 26 states. [2019-10-07 00:22:43,897 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-10-07 00:22:44,223 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-10-07 00:22:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:22:44,466 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-10-07 00:22:44,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-07 00:22:44,466 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 18 [2019-10-07 00:22:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:22:44,467 INFO L225 Difference]: With dead ends: 35 [2019-10-07 00:22:44,467 INFO L226 Difference]: Without dead ends: 24 [2019-10-07 00:22:44,469 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=330, Invalid=1740, Unknown=0, NotChecked=0, Total=2070 [2019-10-07 00:22:44,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-07 00:22:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-07 00:22:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-07 00:22:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-10-07 00:22:44,475 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2019-10-07 00:22:44,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:22:44,475 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-10-07 00:22:44,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-07 00:22:44,475 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-10-07 00:22:44,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 00:22:44,476 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:22:44,476 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:22:44,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:44,680 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:22:44,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:22:44,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1250401810, now seen corresponding path program 3 times [2019-10-07 00:22:44,681 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:22:44,682 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:44,682 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:44,682 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:44,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:22:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:22:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:22:44,751 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:44,752 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:22:44,752 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:44,822 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:22:44,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:22:44,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:22:44,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:22:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:22:44,843 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:22:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:22:44,922 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:22:44,923 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:22:44,925 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:22:44,926 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:22:44,927 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:22:44,927 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:22:45,003 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 29 for LOIs [2019-10-07 00:22:45,197 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:22:45,204 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:22:45,204 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:22:45,204 INFO L193 IcfgInterpreter]: Reachable states at location L15-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:22:45,205 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:22:45,205 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 78#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:45,206 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-07 00:22:45,206 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_60~0)| ~__return_60~0)) [2019-10-07 00:22:45,206 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:22:45,206 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~__return_60~0)|) (= |#valid| |old(#valid)|) (<= |old(~__return_60~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= |old(~__return_60~0)| ~__return_60~0) (= |old(#length)| |#length|) (= |old(~__return_60~0)| 0)) [2019-10-07 00:22:45,207 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem4|) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:45,207 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:22:45,207 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:22:45,207 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 129#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (= main_~__tmp_1~0 1) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (not (<= main_~main__i~0 main_~main__pos~0)) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (or (and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) (and (<= main_~main__pos~0 100000) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__i~0) (<= main_~__tmp_1~0 1) (<= 100000 main_~i~0) (<= 1 main_~__tmp_1~0) (<= 0 main_~main__pos~0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= main_~main__i~0 100000)))) [2019-10-07 00:22:45,207 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 119#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:45,208 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 134#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:22:45,683 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-10-07 00:22:45,684 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:22:45,684 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-07 00:22:45,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-07 00:22:45,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-07 00:22:45,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-10-07 00:22:45,686 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 25 states. [2019-10-07 00:22:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:22:46,393 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-10-07 00:22:46,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-07 00:22:46,394 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 23 [2019-10-07 00:22:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:22:46,395 INFO L225 Difference]: With dead ends: 44 [2019-10-07 00:22:46,395 INFO L226 Difference]: Without dead ends: 31 [2019-10-07 00:22:46,397 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2019-10-07 00:22:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-07 00:22:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-07 00:22:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 00:22:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-10-07 00:22:46,404 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2019-10-07 00:22:46,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:22:46,405 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-10-07 00:22:46,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-07 00:22:46,405 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-10-07 00:22:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-07 00:22:46,406 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:22:46,406 INFO L385 BasicCegarLoop]: trace histogram [12, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:22:46,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:46,610 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:22:46,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:22:46,611 INFO L82 PathProgramCache]: Analyzing trace with hash -900767646, now seen corresponding path program 4 times [2019-10-07 00:22:46,612 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:22:46,612 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:46,612 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:46,612 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:46,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:22:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:22:46,817 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:22:46,817 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:46,817 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:22:46,818 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:22:46,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-07 00:22:46,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:22:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:22:46,904 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:22:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:22:47,149 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:22:47,150 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:22:47,150 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:22:47,151 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:22:47,151 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:22:47,151 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:22:47,184 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 31 for LOIs [2019-10-07 00:22:47,332 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:22:47,338 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:22:47,338 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:22:47,338 INFO L193 IcfgInterpreter]: Reachable states at location L15-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:22:47,339 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:22:47,339 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 78#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:47,339 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-07 00:22:47,339 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_60~0)| ~__return_60~0)) [2019-10-07 00:22:47,339 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:22:47,340 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~__return_60~0)|) (<= |old(~__return_60~0)| 0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= |old(~__return_60~0)| ~__return_60~0) (= |old(#length)| |#length|) (= |old(~__return_60~0)| 0)) [2019-10-07 00:22:47,340 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem4|) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:47,340 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:22:47,340 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:22:47,341 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 129#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (= main_~__tmp_1~0 1) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (not (<= main_~main__i~0 main_~main__pos~0)) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (or (and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) (and (<= main_~main__pos~0 100000) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__i~0) (<= main_~__tmp_1~0 1) (<= 100000 main_~i~0) (<= 1 main_~__tmp_1~0) (<= 0 main_~main__pos~0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= main_~main__i~0 100000)))) [2019-10-07 00:22:47,341 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 119#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:47,341 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 134#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:22:47,821 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-10-07 00:22:47,822 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:22:47,822 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-07 00:22:47,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-07 00:22:47,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-07 00:22:47,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1040, Unknown=0, NotChecked=0, Total=1482 [2019-10-07 00:22:47,826 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 39 states. [2019-10-07 00:22:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:22:49,208 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2019-10-07 00:22:49,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-07 00:22:49,212 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 30 [2019-10-07 00:22:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:22:49,213 INFO L225 Difference]: With dead ends: 58 [2019-10-07 00:22:49,213 INFO L226 Difference]: Without dead ends: 45 [2019-10-07 00:22:49,215 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1294 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1253, Invalid=3859, Unknown=0, NotChecked=0, Total=5112 [2019-10-07 00:22:49,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-07 00:22:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-07 00:22:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-07 00:22:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-10-07 00:22:49,223 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 30 [2019-10-07 00:22:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:22:49,224 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-10-07 00:22:49,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-07 00:22:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-10-07 00:22:49,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 00:22:49,225 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:22:49,226 INFO L385 BasicCegarLoop]: trace histogram [26, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:22:49,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:49,430 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:22:49,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:22:49,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1717249438, now seen corresponding path program 5 times [2019-10-07 00:22:49,431 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:22:49,431 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:49,432 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:49,432 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:49,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:22:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:22:49,884 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:22:49,884 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:49,884 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:22:49,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:49,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-07 00:22:49,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:22:49,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-07 00:22:49,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:22:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-07 00:22:50,520 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:22:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-07 00:22:50,934 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:22:50,935 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:22:50,935 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:22:50,936 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:22:50,936 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:22:50,936 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:22:50,968 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 31 for LOIs [2019-10-07 00:22:51,134 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:22:51,142 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:22:51,142 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:22:51,143 INFO L193 IcfgInterpreter]: Reachable states at location L15-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:22:51,143 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:22:51,144 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 78#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:51,144 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-07 00:22:51,144 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_60~0)| ~__return_60~0)) [2019-10-07 00:22:51,145 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:22:51,145 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~__return_60~0)|) (<= |old(~__return_60~0)| 0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= |old(~__return_60~0)| ~__return_60~0) (= |old(#length)| |#length|) (= |old(~__return_60~0)| 0)) [2019-10-07 00:22:51,146 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem4|) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:51,146 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:22:51,146 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:22:51,147 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 129#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (= main_~__tmp_1~0 1) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (not (<= main_~main__i~0 main_~main__pos~0)) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (or (and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) (and (<= main_~main__pos~0 100000) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__i~0) (<= main_~__tmp_1~0 1) (<= 100000 main_~i~0) (<= 1 main_~__tmp_1~0) (<= 0 main_~main__pos~0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= main_~main__i~0 100000)))) [2019-10-07 00:22:51,147 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 119#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:51,148 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 134#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:22:51,993 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-10-07 00:22:51,994 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:22:51,995 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 11, 11, 11] total 56 [2019-10-07 00:22:51,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-07 00:22:51,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-07 00:22:51,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2551, Unknown=0, NotChecked=0, Total=3080 [2019-10-07 00:22:51,998 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 56 states. [2019-10-07 00:22:54,583 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-10-07 00:22:54,888 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-10-07 00:22:55,159 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-10-07 00:22:55,507 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-10-07 00:22:55,951 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-10-07 00:22:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:22:56,645 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-10-07 00:22:56,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-07 00:22:56,646 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 44 [2019-10-07 00:22:56,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:22:56,647 INFO L225 Difference]: With dead ends: 69 [2019-10-07 00:22:56,647 INFO L226 Difference]: Without dead ends: 54 [2019-10-07 00:22:56,651 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2698 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1732, Invalid=9398, Unknown=0, NotChecked=0, Total=11130 [2019-10-07 00:22:56,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-07 00:22:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-07 00:22:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-07 00:22:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-10-07 00:22:56,664 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 44 [2019-10-07 00:22:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:22:56,665 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-10-07 00:22:56,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-07 00:22:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-10-07 00:22:56,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-07 00:22:56,667 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:22:56,667 INFO L385 BasicCegarLoop]: trace histogram [27, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:22:56,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:56,874 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:22:56,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:22:56,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1906505058, now seen corresponding path program 6 times [2019-10-07 00:22:56,875 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:22:56,875 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:56,875 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:56,875 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:22:56,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:22:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:22:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:22:57,330 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:22:57,331 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:22:57,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:22:57,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:22:57,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:22:57,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-07 00:22:57,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:22:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:22:57,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:22:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:22:58,439 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:22:58,440 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:22:58,440 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:22:58,440 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:22:58,441 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:22:58,441 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:22:58,467 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 29 for LOIs [2019-10-07 00:22:58,580 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:22:58,584 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:22:58,585 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:22:58,585 INFO L193 IcfgInterpreter]: Reachable states at location L15-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:22:58,585 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 78#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:58,585 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:22:58,586 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-07 00:22:58,586 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_60~0)| ~__return_60~0)) [2019-10-07 00:22:58,586 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:22:58,586 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~__return_60~0)|) (= |#valid| |old(#valid)|) (<= |old(~__return_60~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= |old(~__return_60~0)| ~__return_60~0) (= |old(#length)| |#length|) (= |old(~__return_60~0)| 0)) [2019-10-07 00:22:58,586 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem4|) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:58,587 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:22:58,587 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:22:58,587 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 129#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (= main_~__tmp_1~0 1) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (not (<= main_~main__i~0 main_~main__pos~0)) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (or (and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) (and (<= main_~main__pos~0 100000) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__i~0) (<= main_~__tmp_1~0 1) (<= 100000 main_~i~0) (<= 1 main_~__tmp_1~0) (<= 0 main_~main__pos~0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= main_~main__i~0 100000)))) [2019-10-07 00:22:58,587 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 119#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:22:58,587 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 134#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:22:59,126 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-10-07 00:22:59,127 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:22:59,127 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-07 00:22:59,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-07 00:22:59,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-07 00:22:59,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1747, Invalid=2945, Unknown=0, NotChecked=0, Total=4692 [2019-10-07 00:22:59,131 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 69 states. [2019-10-07 00:23:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:23:02,513 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2019-10-07 00:23:02,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-07 00:23:02,514 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 53 [2019-10-07 00:23:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:23:02,515 INFO L225 Difference]: With dead ends: 104 [2019-10-07 00:23:02,515 INFO L226 Difference]: Without dead ends: 83 [2019-10-07 00:23:02,520 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3799 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5108, Invalid=12184, Unknown=0, NotChecked=0, Total=17292 [2019-10-07 00:23:02,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-07 00:23:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-10-07 00:23:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-07 00:23:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-10-07 00:23:02,532 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 53 [2019-10-07 00:23:02,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:23:02,532 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-10-07 00:23:02,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-07 00:23:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-10-07 00:23:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-07 00:23:02,536 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:23:02,536 INFO L385 BasicCegarLoop]: trace histogram [56, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:23:02,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:23:02,739 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:23:02,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:23:02,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1261810414, now seen corresponding path program 7 times [2019-10-07 00:23:02,740 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:23:02,740 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:23:02,741 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:23:02,741 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:23:02,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:23:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:23:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1652 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:23:04,085 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:23:04,085 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:23:04,085 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:23:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:23:04,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-07 00:23:04,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:23:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1652 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:23:04,262 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:23:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1652 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:23:07,846 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:23:07,847 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:23:07,848 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:23:07,848 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:23:07,848 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:23:07,849 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:23:07,879 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 31 for LOIs [2019-10-07 00:23:08,006 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:23:08,012 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:23:08,013 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:23:08,013 INFO L193 IcfgInterpreter]: Reachable states at location L15-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:23:08,014 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 78#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~main__pos~0)) [2019-10-07 00:23:08,014 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:23:08,014 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-07 00:23:08,014 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_60~0)| ~__return_60~0)) [2019-10-07 00:23:08,014 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:23:08,014 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~__return_60~0)|) (= |#valid| |old(#valid)|) (<= |old(~__return_60~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= |old(~__return_60~0)| ~__return_60~0) (= |old(#length)| |#length|) (= |old(~__return_60~0)| 0)) [2019-10-07 00:23:08,015 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem4|) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:23:08,015 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:23:08,015 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:23:08,015 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 129#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (= main_~__tmp_1~0 1) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (not (<= main_~main__i~0 main_~main__pos~0)) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (or (and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) (and (<= main_~main__pos~0 100000) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__i~0) (<= main_~__tmp_1~0 1) (<= 100000 main_~i~0) (<= 1 main_~__tmp_1~0) (<= 0 main_~main__pos~0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= main_~main__i~0 100000)))) [2019-10-07 00:23:08,015 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 119#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:23:08,015 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 134#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:23:08,720 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-10-07 00:23:08,721 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:23:08,721 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-07 00:23:08,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-07 00:23:08,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-07 00:23:08,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6822, Invalid=9180, Unknown=0, NotChecked=0, Total=16002 [2019-10-07 00:23:08,728 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 127 states. [2019-10-07 00:23:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:23:18,991 INFO L93 Difference]: Finished difference Result 162 states and 221 transitions. [2019-10-07 00:23:18,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-07 00:23:18,991 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 82 [2019-10-07 00:23:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:23:18,993 INFO L225 Difference]: With dead ends: 162 [2019-10-07 00:23:18,993 INFO L226 Difference]: Without dead ends: 141 [2019-10-07 00:23:18,998 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11832 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=20217, Invalid=41039, Unknown=0, NotChecked=0, Total=61256 [2019-10-07 00:23:18,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-07 00:23:19,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-10-07 00:23:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-07 00:23:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-10-07 00:23:19,017 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 82 [2019-10-07 00:23:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:23:19,017 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-10-07 00:23:19,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-07 00:23:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-10-07 00:23:19,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-07 00:23:19,020 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:23:19,020 INFO L385 BasicCegarLoop]: trace histogram [114, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:23:19,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:23:19,225 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:23:19,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:23:19,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1778012398, now seen corresponding path program 8 times [2019-10-07 00:23:19,226 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:23:19,226 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:23:19,227 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:23:19,227 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:23:19,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:23:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:23:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6611 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-07 00:23:24,496 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:23:24,496 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:23:24,496 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 [2019-10-07 00:23:24,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-07 00:23:24,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:23:24,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-07 00:23:24,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:23:26,632 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 102 [2019-10-07 00:23:28,754 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 818 DAG size of output: 44 [2019-10-07 00:23:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6611 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 6555 trivial. 0 not checked. [2019-10-07 00:23:29,395 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:23:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6611 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 6555 trivial. 0 not checked. [2019-10-07 00:23:31,519 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:23:31,520 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:23:31,520 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:23:31,521 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:23:31,521 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:23:31,521 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:23:31,546 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 31 for LOIs [2019-10-07 00:23:31,655 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:23:31,659 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:23:31,659 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:23:31,659 INFO L193 IcfgInterpreter]: Reachable states at location L15-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:23:31,660 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 78#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~main__pos~0)) [2019-10-07 00:23:31,660 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:23:31,660 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-07 00:23:31,660 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_60~0)| ~__return_60~0)) [2019-10-07 00:23:31,661 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:23:31,661 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~__return_60~0)|) (<= |old(~__return_60~0)| 0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= |old(~__return_60~0)| ~__return_60~0) (= |old(#length)| |#length|) (= |old(~__return_60~0)| 0)) [2019-10-07 00:23:31,661 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem4|) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:23:31,661 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:23:31,661 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:23:31,661 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 129#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (= main_~__tmp_1~0 1) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (not (<= main_~main__i~0 main_~main__pos~0)) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (or (and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) (and (<= main_~main__pos~0 100000) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__i~0) (<= main_~__tmp_1~0 1) (<= 100000 main_~i~0) (<= 1 main_~__tmp_1~0) (<= 0 main_~main__pos~0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= main_~main__i~0 100000)))) [2019-10-07 00:23:31,662 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 119#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:23:31,662 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 134#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:23:33,024 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-10-07 00:23:33,025 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:23:33,025 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 19, 19, 11] total 160 [2019-10-07 00:23:33,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-10-07 00:23:33,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-10-07 00:23:33,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7078, Invalid=18362, Unknown=0, NotChecked=0, Total=25440 [2019-10-07 00:23:33,030 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 160 states. [2019-10-07 00:23:48,437 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-10-07 00:23:48,943 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 65 [2019-10-07 00:23:49,669 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 100 [2019-10-07 00:23:50,373 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 103 [2019-10-07 00:23:50,832 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2019-10-07 00:23:51,179 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-10-07 00:23:51,681 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-10-07 00:23:52,061 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-10-07 00:23:52,335 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-10-07 00:23:52,769 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-10-07 00:23:53,097 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-10-07 00:23:53,467 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-07 00:23:53,744 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-10-07 00:23:54,088 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-07 00:23:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:23:56,033 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2019-10-07 00:23:56,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-10-07 00:23:56,034 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 140 [2019-10-07 00:23:56,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:23:56,036 INFO L225 Difference]: With dead ends: 181 [2019-10-07 00:23:56,036 INFO L226 Difference]: Without dead ends: 158 [2019-10-07 00:23:56,039 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 377 SyntacticMatches, 1 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20263 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=21644, Invalid=76638, Unknown=0, NotChecked=0, Total=98282 [2019-10-07 00:23:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-07 00:23:56,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-10-07 00:23:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-07 00:23:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2019-10-07 00:23:56,059 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 140 [2019-10-07 00:23:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:23:56,060 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2019-10-07 00:23:56,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-10-07 00:23:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2019-10-07 00:23:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-07 00:23:56,062 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:23:56,063 INFO L385 BasicCegarLoop]: trace histogram [115, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:23:56,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:23:56,268 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:23:56,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:23:56,268 INFO L82 PathProgramCache]: Analyzing trace with hash -936584266, now seen corresponding path program 9 times [2019-10-07 00:23:56,268 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:23:56,269 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:23:56,269 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:23:56,269 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:23:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:23:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6910 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-07 00:24:01,354 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:01,355 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:01,355 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:01,607 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:24:01,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:24:01,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-07 00:24:01,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6910 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-07 00:24:01,699 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6910 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-07 00:24:16,286 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:16,287 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:24:16,287 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:16,288 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:16,288 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:16,288 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:16,314 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 31 for LOIs [2019-10-07 00:24:16,418 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:24:16,422 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:16,422 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:16,422 INFO L193 IcfgInterpreter]: Reachable states at location L15-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:24:16,422 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 78#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~main__pos~0)) [2019-10-07 00:24:16,423 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:24:16,423 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-07 00:24:16,423 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_60~0)| ~__return_60~0)) [2019-10-07 00:24:16,423 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:24:16,423 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~__return_60~0)|) (<= |old(~__return_60~0)| 0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= |old(~__return_60~0)| ~__return_60~0) (= |old(#length)| |#length|) (= |old(~__return_60~0)| 0)) [2019-10-07 00:24:16,423 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem4|) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:24:16,423 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:24:16,424 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:16,424 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 129#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (= main_~__tmp_1~0 1) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (not (<= main_~main__i~0 main_~main__pos~0)) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (or (and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) (and (<= main_~main__pos~0 100000) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__i~0) (<= main_~__tmp_1~0 1) (<= 100000 main_~i~0) (<= 1 main_~__tmp_1~0) (<= 0 main_~main__pos~0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= main_~main__i~0 100000)))) [2019-10-07 00:24:16,424 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 119#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:24:16,424 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 134#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:24:17,490 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-10-07 00:24:17,491 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:17,491 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118, 118, 11] total 245 [2019-10-07 00:24:17,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 245 states [2019-10-07 00:24:17,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2019-10-07 00:24:17,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27531, Invalid=32249, Unknown=0, NotChecked=0, Total=59780 [2019-10-07 00:24:17,496 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 245 states. [2019-10-07 00:24:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:53,569 INFO L93 Difference]: Finished difference Result 312 states and 430 transitions. [2019-10-07 00:24:53,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-10-07 00:24:53,570 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 157 [2019-10-07 00:24:53,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:53,572 INFO L225 Difference]: With dead ends: 312 [2019-10-07 00:24:53,573 INFO L226 Difference]: Without dead ends: 275 [2019-10-07 00:24:53,579 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 827 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41155 ImplicationChecksByTransitivity, 54.8s TimeCoverageRelationStatistics Valid=82108, Invalid=151664, Unknown=0, NotChecked=0, Total=233772 [2019-10-07 00:24:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-10-07 00:24:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-10-07 00:24:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-07 00:24:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2019-10-07 00:24:53,607 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 157 [2019-10-07 00:24:53,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:53,607 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2019-10-07 00:24:53,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 245 states. [2019-10-07 00:24:53,607 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2019-10-07 00:24:53,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-07 00:24:53,611 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:53,611 INFO L385 BasicCegarLoop]: trace histogram [232, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:53,823 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:53,823 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:53,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:53,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1100956666, now seen corresponding path program 10 times [2019-10-07 00:24:53,824 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:53,825 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:53,825 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:53,825 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:53,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:25:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 27268 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-07 00:25:13,873 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:25:13,874 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:25:13,874 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:25:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:25:14,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 1544 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-07 00:25:14,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:25:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 27268 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-07 00:25:14,376 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:26:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 27268 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-07 00:26:12,422 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:26:12,423 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:26:12,423 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:26:12,424 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:26:12,424 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:26:12,424 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:26:12,463 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 31 for LOIs [2019-10-07 00:26:12,570 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:26:12,573 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:26:12,573 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:26:12,574 INFO L193 IcfgInterpreter]: Reachable states at location L15-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:26:12,574 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 78#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~main__pos~0)) [2019-10-07 00:26:12,574 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:26:12,574 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-07 00:26:12,574 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_60~0)| ~__return_60~0)) [2019-10-07 00:26:12,574 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:26:12,575 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~__return_60~0)|) (<= |old(~__return_60~0)| 0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= |old(~__return_60~0)| ~__return_60~0) (= |old(#length)| |#length|) (= |old(~__return_60~0)| 0)) [2019-10-07 00:26:12,575 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem4|) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:26:12,575 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:26:12,575 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:26:12,576 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 129#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (= main_~__tmp_1~0 1) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (not (<= main_~main__i~0 main_~main__pos~0)) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (or (and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) (and (<= main_~main__pos~0 100000) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__i~0) (<= main_~__tmp_1~0 1) (<= 100000 main_~i~0) (<= 1 main_~__tmp_1~0) (<= 0 main_~main__pos~0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= main_~main__i~0 100000)))) [2019-10-07 00:26:12,576 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 119#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:26:12,576 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 134#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:26:14,595 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-10-07 00:26:14,597 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:26:14,597 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 11] total 479 [2019-10-07 00:26:14,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 479 states [2019-10-07 00:26:14,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 479 interpolants. [2019-10-07 00:26:14,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109782, Invalid=119180, Unknown=0, NotChecked=0, Total=228962 [2019-10-07 00:26:14,611 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 479 states. [2019-10-07 00:28:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:28:30,160 INFO L93 Difference]: Finished difference Result 546 states and 781 transitions. [2019-10-07 00:28:30,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 478 states. [2019-10-07 00:28:30,161 INFO L78 Accepts]: Start accepts. Automaton has 479 states. Word has length 274 [2019-10-07 00:28:30,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:28:30,165 INFO L225 Difference]: With dead ends: 546 [2019-10-07 00:28:30,165 INFO L226 Difference]: Without dead ends: 509 [2019-10-07 00:28:30,183 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1529 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150784 ImplicationChecksByTransitivity, 203.7s TimeCoverageRelationStatistics Valid=328393, Invalid=576959, Unknown=0, NotChecked=0, Total=905352 [2019-10-07 00:28:30,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-10-07 00:28:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2019-10-07 00:28:30,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-10-07 00:28:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 510 transitions. [2019-10-07 00:28:30,217 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 510 transitions. Word has length 274 [2019-10-07 00:28:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:28:30,218 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 510 transitions. [2019-10-07 00:28:30,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 479 states. [2019-10-07 00:28:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 510 transitions. [2019-10-07 00:28:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-10-07 00:28:30,228 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:28:30,229 INFO L385 BasicCegarLoop]: trace histogram [466, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:28:30,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:30,435 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:28:30,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:28:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash -860231162, now seen corresponding path program 11 times [2019-10-07 00:28:30,436 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:28:30,436 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:30,436 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:30,436 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:30,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:28:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 109051 backedges. 0 proven. 108811 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-07 00:29:48,091 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:48,091 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:48,091 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:55,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-07 00:29:55,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:29:55,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 138 conjunts are in the unsatisfiable core [2019-10-07 00:29:55,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:31:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 109051 backedges. 457 proven. 4398 refuted. 0 times theorem prover too weak. 104196 trivial. 0 not checked. [2019-10-07 00:31:19,085 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:31:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 109051 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 108811 trivial. 0 not checked. [2019-10-07 00:31:34,931 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:31:34,932 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:31:34,932 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:31:34,932 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:31:34,933 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:31:34,933 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:31:34,958 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 29 for LOIs [2019-10-07 00:31:35,069 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:31:35,073 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:31:35,073 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:31:35,073 INFO L193 IcfgInterpreter]: Reachable states at location L15-4 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:31:35,074 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 78#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~main__pos~0)) [2019-10-07 00:31:35,074 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:31:35,074 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-07 00:31:35,074 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_60~0)| ~__return_60~0)) [2019-10-07 00:31:35,074 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem4|) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:31:35,075 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:31:35,075 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~__return_60~0)|) (= |#valid| |old(#valid)|) (<= |old(~__return_60~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= |old(~__return_60~0)| ~__return_60~0) (= |old(#length)| |#length|) (= |old(~__return_60~0)| 0)) [2019-10-07 00:31:35,075 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(and (= 0 |#NULL.base|) (<= ~__return_60~0 0) (<= |#NULL.base| 0) (= 0 ~__return_60~0) (<= 0 ~__return_60~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0)) [2019-10-07 00:31:35,075 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:31:35,075 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 129#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (= main_~__tmp_1~0 1) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (not (<= main_~main__i~0 main_~main__pos~0)) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (or (and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) (and (<= main_~main__pos~0 100000) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__i~0) (<= main_~__tmp_1~0 1) (<= 100000 main_~i~0) (<= 1 main_~__tmp_1~0) (<= 0 main_~main__pos~0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= main_~main__i~0 100000)))) [2019-10-07 00:31:35,075 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 119#(and (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (<= 100000 main_~i~0) (<= 0 main_~main__pos~0)) [2019-10-07 00:31:35,075 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 134#(and (or (and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__pos~0 100000) (<= 0 main_~main__i~0) (= main_~__tmp_1~0 1) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0)) (and (<= main_~main__pos~0 100000) (not (<= main_~main__i~0 main_~main__pos~0)) (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 0) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) main_~main__marker~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~__tmp_1~0 0))) (<= 100000 main_~i~0) (<= 0 main_~__VERIFIER_assert__cond~0) (<= main_~__VERIFIER_assert__cond~0 0) (<= main_~__tmp_1~0 0) (<= 0 main_~main__pos~0) (<= 0 main_~__tmp_1~0)) [2019-10-07 00:31:38,837 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-10-07 00:31:38,839 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:31:38,840 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [469, 46, 35, 11] total 556 [2019-10-07 00:31:38,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 556 states [2019-10-07 00:31:38,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 556 interpolants. [2019-10-07 00:31:38,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114940, Invalid=193640, Unknown=0, NotChecked=0, Total=308580 [2019-10-07 00:31:38,858 INFO L87 Difference]: Start difference. First operand 509 states and 510 transitions. Second operand 556 states. [2019-10-07 00:34:57,060 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-10-07 00:34:58,636 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-10-07 00:34:59,446 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-10-07 00:35:00,253 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-10-07 00:35:01,135 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-10-07 00:35:02,004 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2019-10-07 00:35:02,918 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-10-07 00:35:03,792 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2019-10-07 00:35:04,744 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-10-07 00:35:05,663 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2019-10-07 00:35:06,634 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-10-07 00:35:07,604 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-10-07 00:35:08,625 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-10-07 00:35:09,718 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 92 [2019-10-07 00:35:10,771 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2019-10-07 00:35:11,793 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-10-07 00:35:12,880 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 98 [2019-10-07 00:35:13,957 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 102 [2019-10-07 00:35:15,071 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 102 [2019-10-07 00:35:17,618 WARN L191 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 107 [2019-10-07 00:35:20,643 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 178 DAG size of output: 177 [2019-10-07 00:35:24,253 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 196 DAG size of output: 180 [2019-10-07 00:35:26,666 WARN L191 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 138 [2019-10-07 00:35:27,889 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 43