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-crafted/zero_sum5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:02:15,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:02:15,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:02:15,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:02:15,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:02:15,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:02:15,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:02:15,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:02:15,599 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:02:15,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:02:15,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:02:15,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:02:15,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:02:15,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:02:15,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:02:15,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:02:15,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:02:15,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:02:15,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:02:15,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:02:15,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:02:15,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:02:15,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:02:15,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:02:15,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:02:15,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:02:15,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:02:15,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:02:15,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:02:15,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:02:15,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:02:15,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:02:15,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:02:15,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:02:15,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:02:15,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:02:15,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:02:15,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:02:15,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:02:15,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:02:15,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:02:15,625 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-06 23:02:15,638 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:02:15,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:02:15,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:02:15,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:02:15,640 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:02:15,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:02:15,641 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:02:15,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:02:15,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:02:15,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:02:15,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:02:15,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:02:15,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:02:15,642 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:02:15,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:02:15,642 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:02:15,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:02:15,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:02:15,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:02:15,643 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:02:15,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:02:15,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:02:15,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:02:15,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:02:15,644 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:02:15,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:02:15,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:02:15,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:02:15,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-06 23:02:15,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:02:15,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:02:15,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:02:15,924 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:02:15,925 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:02:15,925 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum5.c [2019-10-06 23:02:15,996 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bab0b499/258c83859eb2456f946c31f4fdebf153/FLAGcff0d5818 [2019-10-06 23:02:16,433 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:02:16,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum5.c [2019-10-06 23:02:16,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bab0b499/258c83859eb2456f946c31f4fdebf153/FLAGcff0d5818 [2019-10-06 23:02:16,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bab0b499/258c83859eb2456f946c31f4fdebf153 [2019-10-06 23:02:16,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:02:16,841 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:02:16,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:02:16,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:02:16,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:02:16,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:02:16" (1/1) ... [2019-10-06 23:02:16,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@358a6207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:16, skipping insertion in model container [2019-10-06 23:02:16,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:02:16" (1/1) ... [2019-10-06 23:02:16,856 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:02:16,877 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:02:17,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:02:17,062 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:02:17,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:02:17,203 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:02:17,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:17 WrapperNode [2019-10-06 23:02:17,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:02:17,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:02:17,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:02:17,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:02:17,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:17" (1/1) ... [2019-10-06 23:02:17,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:17" (1/1) ... [2019-10-06 23:02:17,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:17" (1/1) ... [2019-10-06 23:02:17,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:17" (1/1) ... [2019-10-06 23:02:17,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:17" (1/1) ... [2019-10-06 23:02:17,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:17" (1/1) ... [2019-10-06 23:02:17,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:17" (1/1) ... [2019-10-06 23:02:17,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:02:17,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:02:17,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:02:17,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:02:17,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:02:17,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:02:17,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:02:17,315 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:02:17,315 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:02:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:02:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-06 23:02:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:02:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-10-06 23:02:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:02:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:02:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:02:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:02:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:02:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:02:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:02:17,899 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:02:17,899 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-06 23:02:17,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:02:17 BoogieIcfgContainer [2019-10-06 23:02:17,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:02:17,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:02:17,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:02:17,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:02:17,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:02:16" (1/3) ... [2019-10-06 23:02:17,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661eee11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:02:17, skipping insertion in model container [2019-10-06 23:02:17,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:17" (2/3) ... [2019-10-06 23:02:17,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661eee11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:02:17, skipping insertion in model container [2019-10-06 23:02:17,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:02:17" (3/3) ... [2019-10-06 23:02:17,912 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum5.c [2019-10-06 23:02:17,922 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:02:17,931 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:02:17,943 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:02:17,969 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:02:17,969 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:02:17,969 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:02:17,969 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:02:17,969 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:02:17,970 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:02:17,970 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:02:17,971 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:02:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-06 23:02:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:02:17,997 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:17,998 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:18,000 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:18,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:18,006 INFO L82 PathProgramCache]: Analyzing trace with hash -205990741, now seen corresponding path program 1 times [2019-10-06 23:02:18,015 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:18,016 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:18,016 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:18,016 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:18,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:02:18,248 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:18,249 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:02:18,249 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-06 23:02:18,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-06 23:02:18,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-06 23:02:18,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-06 23:02:18,270 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2019-10-06 23:02:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:18,395 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2019-10-06 23:02:18,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-06 23:02:18,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-06 23:02:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:18,411 INFO L225 Difference]: With dead ends: 56 [2019-10-06 23:02:18,411 INFO L226 Difference]: Without dead ends: 32 [2019-10-06 23:02:18,415 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-06 23:02:18,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-06 23:02:18,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-06 23:02:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-06 23:02:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 51 transitions. [2019-10-06 23:02:18,468 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 51 transitions. Word has length 21 [2019-10-06 23:02:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:18,470 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 51 transitions. [2019-10-06 23:02:18,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-06 23:02:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 51 transitions. [2019-10-06 23:02:18,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-06 23:02:18,474 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:18,474 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:18,475 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:18,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:18,477 INFO L82 PathProgramCache]: Analyzing trace with hash 940905143, now seen corresponding path program 1 times [2019-10-06 23:02:18,477 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:18,477 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:18,478 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:18,478 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:18,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:02:18,590 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:18,590 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:02:18,591 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:02:18,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:02:18,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:02:18,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:02:18,593 INFO L87 Difference]: Start difference. First operand 32 states and 51 transitions. Second operand 3 states. [2019-10-06 23:02:18,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:18,664 INFO L93 Difference]: Finished difference Result 58 states and 96 transitions. [2019-10-06 23:02:18,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:02:18,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-06 23:02:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:18,666 INFO L225 Difference]: With dead ends: 58 [2019-10-06 23:02:18,667 INFO L226 Difference]: Without dead ends: 33 [2019-10-06 23:02:18,668 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:02:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-06 23:02:18,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-06 23:02:18,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-06 23:02:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2019-10-06 23:02:18,685 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 22 [2019-10-06 23:02:18,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:18,686 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 52 transitions. [2019-10-06 23:02:18,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:02:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 52 transitions. [2019-10-06 23:02:18,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-06 23:02:18,689 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:18,689 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:18,689 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:18,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:18,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1041186174, now seen corresponding path program 1 times [2019-10-06 23:02:18,690 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:18,690 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:18,691 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:18,691 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:18,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:02:18,802 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:18,803 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:02:18,803 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-06 23:02:18,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-06 23:02:18,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-06 23:02:18,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:02:18,806 INFO L87 Difference]: Start difference. First operand 33 states and 52 transitions. Second operand 4 states. [2019-10-06 23:02:18,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:18,938 INFO L93 Difference]: Finished difference Result 56 states and 92 transitions. [2019-10-06 23:02:18,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:02:18,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-06 23:02:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:18,939 INFO L225 Difference]: With dead ends: 56 [2019-10-06 23:02:18,940 INFO L226 Difference]: Without dead ends: 33 [2019-10-06 23:02:18,942 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:02:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-06 23:02:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-06 23:02:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-06 23:02:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-10-06 23:02:18,955 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 23 [2019-10-06 23:02:18,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:18,956 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-10-06 23:02:18,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-06 23:02:18,956 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2019-10-06 23:02:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-06 23:02:18,959 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:18,959 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:18,959 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:18,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:18,960 INFO L82 PathProgramCache]: Analyzing trace with hash 608840992, now seen corresponding path program 1 times [2019-10-06 23:02:18,960 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:18,960 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:18,960 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:18,960 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:18,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:02:19,059 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:19,059 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:19,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:19,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:02:19,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:02:19,174 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:02:19,211 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:19,258 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:02:19,259 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:19,267 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:19,277 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:19,278 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:19,419 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:02:20,091 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:20,113 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:20,119 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:20,120 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:20,121 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:02:20,121 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:20,122 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:20,123 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:20,124 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:20,124 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:20,124 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:20,125 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:20,125 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:20,125 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:20,126 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:20,126 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:20,126 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:02:20,127 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:20,127 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:20,128 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:20,129 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:20,129 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:20,129 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:20,130 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:02:20,130 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:20,130 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:02:20,481 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:20,481 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 11] total 19 [2019-10-06 23:02:20,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-06 23:02:20,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-06 23:02:20,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-10-06 23:02:20,486 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 19 states. [2019-10-06 23:02:21,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:21,163 INFO L93 Difference]: Finished difference Result 69 states and 99 transitions. [2019-10-06 23:02:21,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-06 23:02:21,164 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-10-06 23:02:21,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:21,165 INFO L225 Difference]: With dead ends: 69 [2019-10-06 23:02:21,166 INFO L226 Difference]: Without dead ends: 44 [2019-10-06 23:02:21,167 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2019-10-06 23:02:21,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-06 23:02:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-06 23:02:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-06 23:02:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-10-06 23:02:21,180 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 32 [2019-10-06 23:02:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:21,180 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-10-06 23:02:21,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-06 23:02:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-10-06 23:02:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-06 23:02:21,184 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:21,184 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:21,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:21,388 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:21,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:21,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1666989621, now seen corresponding path program 2 times [2019-10-06 23:02:21,389 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:21,389 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:21,390 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:21,390 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:21,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:02:22,335 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:22,335 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:22,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:22,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:02:22,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:02:22,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 90 conjunts are in the unsatisfiable core [2019-10-06 23:02:22,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:02:22,720 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:02:23,181 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:23,183 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:02:23,184 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:23,184 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:23,184 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:23,185 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:23,230 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:02:23,633 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:23,644 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:23,648 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:23,648 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:23,648 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:02:23,649 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:23,649 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:23,649 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:23,649 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:23,650 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:23,650 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:23,650 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:23,650 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:23,651 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:23,651 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:23,651 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:23,651 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:02:23,652 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:23,652 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:23,652 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:23,652 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:23,652 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:23,653 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:23,653 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:02:23,653 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:23,653 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:02:24,150 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:24,151 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11, 11] total 33 [2019-10-06 23:02:24,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-06 23:02:24,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-06 23:02:24,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2019-10-06 23:02:24,153 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 33 states. [2019-10-06 23:02:25,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:25,357 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2019-10-06 23:02:25,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-06 23:02:25,358 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2019-10-06 23:02:25,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:25,360 INFO L225 Difference]: With dead ends: 77 [2019-10-06 23:02:25,360 INFO L226 Difference]: Without dead ends: 72 [2019-10-06 23:02:25,362 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 95 SyntacticMatches, 39 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2019-10-06 23:02:25,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-06 23:02:25,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-10-06 23:02:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-06 23:02:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2019-10-06 23:02:25,375 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 43 [2019-10-06 23:02:25,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:25,375 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2019-10-06 23:02:25,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-06 23:02:25,375 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2019-10-06 23:02:25,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-06 23:02:25,376 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:25,377 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:25,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:25,581 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:25,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:25,582 INFO L82 PathProgramCache]: Analyzing trace with hash -893816937, now seen corresponding path program 3 times [2019-10-06 23:02:25,582 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:25,582 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:25,582 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:25,582 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:25,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-06 23:02:25,643 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:25,643 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:25,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:25,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:02:25,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:02:25,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:02:25,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-06 23:02:25,813 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-06 23:02:25,887 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:25,889 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:02:25,889 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:25,890 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:25,891 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:25,891 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:25,920 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:02:26,214 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:26,226 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:26,229 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:26,229 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:26,230 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:02:26,230 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:26,230 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:26,231 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:26,231 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:26,233 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:26,233 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:26,234 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:26,234 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:26,234 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:26,234 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:26,234 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:26,235 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:02:26,235 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:26,235 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:26,235 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:26,236 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:26,236 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:26,236 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:26,236 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:02:26,236 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:26,237 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:02:26,570 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:26,571 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9, 11] total 27 [2019-10-06 23:02:26,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-06 23:02:26,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-06 23:02:26,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-10-06 23:02:26,573 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 27 states. [2019-10-06 23:02:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:28,166 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2019-10-06 23:02:28,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-06 23:02:28,167 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 44 [2019-10-06 23:02:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:28,170 INFO L225 Difference]: With dead ends: 179 [2019-10-06 23:02:28,170 INFO L226 Difference]: Without dead ends: 146 [2019-10-06 23:02:28,172 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=271, Invalid=1891, Unknown=0, NotChecked=0, Total=2162 [2019-10-06 23:02:28,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-06 23:02:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 79. [2019-10-06 23:02:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-06 23:02:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2019-10-06 23:02:28,186 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 44 [2019-10-06 23:02:28,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:28,187 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2019-10-06 23:02:28,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-06 23:02:28,187 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2019-10-06 23:02:28,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-06 23:02:28,188 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:28,189 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:28,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:28,396 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:28,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:28,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1049065353, now seen corresponding path program 4 times [2019-10-06 23:02:28,397 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:28,398 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:28,398 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:28,398 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:28,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-06 23:02:28,479 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:28,479 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:28,480 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:28,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:02:28,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-06 23:02:28,663 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-06 23:02:28,707 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:28,709 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:02:28,710 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:28,711 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:28,711 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:28,712 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:28,735 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:02:28,999 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:29,008 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:29,011 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:29,011 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:29,012 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:02:29,012 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:29,012 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:29,012 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:29,012 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:29,013 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:29,013 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:29,013 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:29,013 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:29,013 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:29,014 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:29,014 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:29,014 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:02:29,014 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:29,014 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:29,014 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:29,015 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:29,015 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:29,015 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:29,015 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:02:29,015 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:29,016 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:02:29,346 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:29,346 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 24 [2019-10-06 23:02:29,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-06 23:02:29,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-06 23:02:29,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-10-06 23:02:29,348 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 24 states. [2019-10-06 23:02:29,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:29,946 INFO L93 Difference]: Finished difference Result 144 states and 179 transitions. [2019-10-06 23:02:29,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:02:29,948 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-10-06 23:02:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:29,949 INFO L225 Difference]: With dead ends: 144 [2019-10-06 23:02:29,949 INFO L226 Difference]: Without dead ends: 76 [2019-10-06 23:02:29,950 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 113 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2019-10-06 23:02:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-06 23:02:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-10-06 23:02:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-06 23:02:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2019-10-06 23:02:29,961 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 44 [2019-10-06 23:02:29,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:29,962 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 94 transitions. [2019-10-06 23:02:29,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-06 23:02:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2019-10-06 23:02:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-06 23:02:29,963 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:29,963 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:30,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:30,167 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:30,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:30,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2141541374, now seen corresponding path program 5 times [2019-10-06 23:02:30,169 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:30,169 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:30,169 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:30,170 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:30,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-06 23:02:30,235 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:30,235 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:30,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:30,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:02:30,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:02:30,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:02:30,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-06 23:02:30,435 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-06 23:02:30,497 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:30,500 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:02:30,500 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:30,500 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:30,501 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:30,501 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:30,520 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:02:30,757 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:30,765 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:30,768 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:30,768 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:30,768 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:02:30,769 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:30,769 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:30,769 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:30,769 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:30,770 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:30,770 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:30,770 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:30,770 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:30,770 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:30,771 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:30,771 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:30,771 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:02:30,771 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:30,772 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:30,772 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:30,772 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:30,772 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:30,772 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:30,773 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:02:30,773 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:30,773 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:02:31,098 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:31,098 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 11] total 24 [2019-10-06 23:02:31,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-06 23:02:31,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-06 23:02:31,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2019-10-06 23:02:31,101 INFO L87 Difference]: Start difference. First operand 76 states and 94 transitions. Second operand 24 states. [2019-10-06 23:02:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:31,628 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2019-10-06 23:02:31,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:02:31,629 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-10-06 23:02:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:31,632 INFO L225 Difference]: With dead ends: 120 [2019-10-06 23:02:31,632 INFO L226 Difference]: Without dead ends: 55 [2019-10-06 23:02:31,633 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 121 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2019-10-06 23:02:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-06 23:02:31,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-06 23:02:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-06 23:02:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-10-06 23:02:31,641 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 45 [2019-10-06 23:02:31,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:31,641 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-10-06 23:02:31,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-06 23:02:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-10-06 23:02:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-06 23:02:31,642 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:31,642 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:31,853 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:31,853 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:31,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:31,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1338189056, now seen corresponding path program 6 times [2019-10-06 23:02:31,854 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:31,855 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:31,855 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:31,855 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:31,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:32,684 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 14 [2019-10-06 23:02:32,867 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 34 [2019-10-06 23:02:33,052 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2019-10-06 23:02:33,232 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 29 [2019-10-06 23:02:33,400 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2019-10-06 23:02:33,606 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 31 [2019-10-06 23:02:33,754 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 24 [2019-10-06 23:02:33,901 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 21 [2019-10-06 23:02:34,046 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 25 [2019-10-06 23:02:34,248 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 28 [2019-10-06 23:02:34,441 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 28 [2019-10-06 23:02:34,601 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 26 [2019-10-06 23:02:34,783 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 31 [2019-10-06 23:02:34,966 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 33 [2019-10-06 23:02:35,126 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 24 [2019-10-06 23:02:35,271 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 20 [2019-10-06 23:02:35,457 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 25 [2019-10-06 23:02:35,638 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2019-10-06 23:02:35,829 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-10-06 23:02:36,009 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 31 [2019-10-06 23:02:36,330 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2019-10-06 23:02:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:02:36,950 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:36,950 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:36,950 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:37,112 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:02:37,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:02:37,115 WARN L254 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 130 conjunts are in the unsatisfiable core [2019-10-06 23:02:37,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:02:37,733 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:38,688 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 28 [2019-10-06 23:02:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:02:38,798 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:38,800 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:02:38,800 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:38,801 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:38,801 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:38,801 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:38,832 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:02:39,107 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:39,118 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:39,123 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:39,123 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:39,124 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:02:39,124 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:39,125 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:39,125 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:39,125 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:39,125 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:39,126 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:39,126 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:39,126 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:39,127 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:39,127 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:39,127 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:02:39,128 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:39,128 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:39,128 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:39,128 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:39,129 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:39,129 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:39,129 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:39,129 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:02:39,130 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:39,136 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:02:40,124 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:40,124 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 13, 13, 11] total 61 [2019-10-06 23:02:40,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-06 23:02:40,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-06 23:02:40,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=3398, Unknown=0, NotChecked=0, Total=3660 [2019-10-06 23:02:40,129 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 61 states. [2019-10-06 23:02:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:44,310 INFO L93 Difference]: Finished difference Result 179 states and 219 transitions. [2019-10-06 23:02:44,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-06 23:02:44,310 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 54 [2019-10-06 23:02:44,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:44,312 INFO L225 Difference]: With dead ends: 179 [2019-10-06 23:02:44,312 INFO L226 Difference]: Without dead ends: 93 [2019-10-06 23:02:44,315 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 114 SyntacticMatches, 37 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3456 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=644, Invalid=7366, Unknown=0, NotChecked=0, Total=8010 [2019-10-06 23:02:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-06 23:02:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2019-10-06 23:02:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-06 23:02:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2019-10-06 23:02:44,339 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 54 [2019-10-06 23:02:44,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:44,341 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2019-10-06 23:02:44,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-06 23:02:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2019-10-06 23:02:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-06 23:02:44,343 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:44,343 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:44,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:44,554 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:44,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:44,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1761891923, now seen corresponding path program 7 times [2019-10-06 23:02:44,555 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:44,556 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:44,556 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:44,556 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:44,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-06 23:02:44,635 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:44,635 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:44,635 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:44,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:02:44,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-06 23:02:44,859 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-06 23:02:44,912 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:44,913 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:02:44,914 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:44,914 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:44,914 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:44,914 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:44,938 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:02:45,146 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:45,155 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:45,158 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:45,158 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:45,158 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:02:45,158 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:45,159 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:45,159 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:45,159 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:45,159 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:45,159 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:45,159 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:45,159 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:45,160 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:45,160 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:45,160 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:02:45,160 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:45,160 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:45,160 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:45,160 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:45,161 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:45,161 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:45,161 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:45,161 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:02:45,161 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:45,161 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:02:45,473 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:45,474 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 27 [2019-10-06 23:02:45,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-06 23:02:45,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-06 23:02:45,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-10-06 23:02:45,476 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 27 states. [2019-10-06 23:02:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:46,217 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2019-10-06 23:02:46,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-06 23:02:46,218 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-10-06 23:02:46,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:46,219 INFO L225 Difference]: With dead ends: 137 [2019-10-06 23:02:46,219 INFO L226 Difference]: Without dead ends: 66 [2019-10-06 23:02:46,221 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 145 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-10-06 23:02:46,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-06 23:02:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-06 23:02:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-06 23:02:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2019-10-06 23:02:46,228 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 56 [2019-10-06 23:02:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:46,229 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2019-10-06 23:02:46,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-06 23:02:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2019-10-06 23:02:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-06 23:02:46,230 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:46,230 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:46,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:46,434 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:46,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:46,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1734428395, now seen corresponding path program 8 times [2019-10-06 23:02:46,435 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:46,436 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:46,436 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:46,436 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:46,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:47,410 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 12 [2019-10-06 23:02:47,636 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 13 [2019-10-06 23:02:47,914 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 34 [2019-10-06 23:02:48,198 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 36 [2019-10-06 23:02:48,477 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 38 [2019-10-06 23:02:48,738 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 34 [2019-10-06 23:02:49,004 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 31 [2019-10-06 23:02:49,274 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 35 [2019-10-06 23:02:49,517 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 31 [2019-10-06 23:02:49,740 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 24 [2019-10-06 23:02:49,936 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 18 [2019-10-06 23:02:50,149 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 16 [2019-10-06 23:02:50,539 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 38 [2019-10-06 23:02:50,778 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 34 [2019-10-06 23:02:50,973 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 27 [2019-10-06 23:02:51,149 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 22 [2019-10-06 23:02:51,459 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 35 [2019-10-06 23:02:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 1 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:02:52,459 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:52,459 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:52,459 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-06 23:02:52,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:02:52,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:02:52,657 WARN L254 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 184 conjunts are in the unsatisfiable core [2019-10-06 23:02:52,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 4 proven. 100 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:02:54,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:02:59,394 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:59,395 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:02:59,395 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:59,396 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:59,396 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:59,396 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:59,416 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:02:59,682 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:59,689 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:59,692 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:59,692 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:59,692 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (<= ~SIZE~0 32767) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:02:59,692 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:59,693 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:59,693 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:59,694 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:59,694 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:59,694 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:59,694 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:59,694 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:59,695 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:59,695 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:59,695 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:02:59,695 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:59,695 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:59,695 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:59,696 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:59,696 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:59,696 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:59,696 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:59,696 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:02:59,696 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:59,697 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:03:00,431 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:03:00,431 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 18, 16, 11] total 65 [2019-10-06 23:03:00,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-06 23:03:00,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-06 23:03:00,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=3860, Unknown=0, NotChecked=0, Total=4160 [2019-10-06 23:03:00,435 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 65 states. [2019-10-06 23:03:01,794 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-10-06 23:03:02,693 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-10-06 23:03:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:03:05,749 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2019-10-06 23:03:05,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-06 23:03:05,751 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-10-06 23:03:05,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:03:05,753 INFO L225 Difference]: With dead ends: 117 [2019-10-06 23:03:05,753 INFO L226 Difference]: Without dead ends: 112 [2019-10-06 23:03:05,755 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 111 SyntacticMatches, 80 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4645 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=648, Invalid=7184, Unknown=0, NotChecked=0, Total=7832 [2019-10-06 23:03:05,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-06 23:03:05,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-10-06 23:03:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-06 23:03:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2019-10-06 23:03:05,769 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 65 [2019-10-06 23:03:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:03:05,770 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2019-10-06 23:03:05,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-06 23:03:05,770 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2019-10-06 23:03:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-06 23:03:05,771 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:03:05,771 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:03:05,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:03:05,979 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:03:05,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:03:05,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1542337655, now seen corresponding path program 9 times [2019-10-06 23:03:05,980 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:03:05,981 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:03:05,981 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:03:05,981 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:03:05,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:03:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:03:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:03:06,093 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:03:06,093 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:03:06,093 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-06 23:03:06,315 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:03:06,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:03:06,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:03:06,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:03:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:03:06,445 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:03:06,577 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:03:06,577 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:03:06,580 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:03:06,580 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:03:06,581 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:03:06,581 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:03:06,582 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:03:06,597 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:03:06,801 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:03:06,810 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:03:06,813 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:03:06,813 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:03:06,813 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:03:06,813 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:03:06,813 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:03:06,814 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:03:06,814 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:03:06,814 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:03:06,814 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:03:06,814 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:03:06,815 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:03:06,815 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:03:06,815 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:03:06,815 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:03:06,815 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:03:06,815 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:03:06,816 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:03:06,816 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:03:06,816 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:03:06,816 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:03:06,816 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:03:06,816 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:03:06,816 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:03:06,817 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:03:07,180 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:03:07,181 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13, 11] total 37 [2019-10-06 23:03:07,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-06 23:03:07,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-06 23:03:07,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1182, Unknown=0, NotChecked=0, Total=1332 [2019-10-06 23:03:07,183 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand 37 states. [2019-10-06 23:03:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:03:09,552 INFO L93 Difference]: Finished difference Result 273 states and 337 transitions. [2019-10-06 23:03:09,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-06 23:03:09,553 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 66 [2019-10-06 23:03:09,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:03:09,555 INFO L225 Difference]: With dead ends: 273 [2019-10-06 23:03:09,555 INFO L226 Difference]: Without dead ends: 222 [2019-10-06 23:03:09,557 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 168 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=492, Invalid=3668, Unknown=0, NotChecked=0, Total=4160 [2019-10-06 23:03:09,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-06 23:03:09,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 117. [2019-10-06 23:03:09,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-06 23:03:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2019-10-06 23:03:09,571 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 66 [2019-10-06 23:03:09,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:03:09,571 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2019-10-06 23:03:09,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-06 23:03:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2019-10-06 23:03:09,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-06 23:03:09,572 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:03:09,572 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:03:09,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:03:09,777 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:03:09,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:03:09,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1315678039, now seen corresponding path program 10 times [2019-10-06 23:03:09,777 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:03:09,778 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:03:09,778 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:03:09,778 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:03:09,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:03:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:03:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:03:09,899 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:03:09,899 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:03:09,899 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-06 23:03:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:03:10,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:03:10,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:03:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:03:10,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:03:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:03:10,241 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:03:10,244 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:03:10,245 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:03:10,245 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:03:10,245 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:03:10,245 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:03:10,260 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:03:10,454 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:03:10,460 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:03:10,462 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:03:10,463 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:03:10,463 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:03:10,463 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:03:10,463 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:03:10,463 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:03:10,464 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:03:10,464 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:03:10,464 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:03:10,464 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:03:10,464 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:03:10,464 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:03:10,464 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:03:10,465 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:03:10,465 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:03:10,465 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:03:10,465 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:03:10,465 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:03:10,465 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:03:10,465 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:03:10,466 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:03:10,466 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:03:10,466 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:03:10,466 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:03:10,862 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:03:10,862 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 30 [2019-10-06 23:03:10,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-06 23:03:10,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-06 23:03:10,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2019-10-06 23:03:10,863 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 30 states. [2019-10-06 23:03:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:03:11,742 INFO L93 Difference]: Finished difference Result 216 states and 251 transitions. [2019-10-06 23:03:11,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-06 23:03:11,742 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2019-10-06 23:03:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:03:11,744 INFO L225 Difference]: With dead ends: 216 [2019-10-06 23:03:11,744 INFO L226 Difference]: Without dead ends: 112 [2019-10-06 23:03:11,745 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 173 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2019-10-06 23:03:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-06 23:03:11,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-10-06 23:03:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-06 23:03:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2019-10-06 23:03:11,758 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 66 [2019-10-06 23:03:11,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:03:11,759 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2019-10-06 23:03:11,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-06 23:03:11,759 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2019-10-06 23:03:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-06 23:03:11,760 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:03:11,760 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:03:11,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:03:11,965 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:03:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:03:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1480983454, now seen corresponding path program 11 times [2019-10-06 23:03:11,966 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:03:11,966 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:03:11,966 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:03:11,966 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:03:11,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:03:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:03:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-06 23:03:12,058 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:03:12,058 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:03:12,058 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-06 23:03:12,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:03:12,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:03:12,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:03:12,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:03:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-06 23:03:12,396 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:03:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-06 23:03:12,455 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:03:12,456 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:03:12,457 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:03:12,457 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:03:12,457 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:03:12,457 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:03:12,473 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:03:12,669 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:03:12,681 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:03:12,683 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:03:12,683 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:03:12,684 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:03:12,684 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:03:12,684 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:03:12,684 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:03:12,684 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:03:12,685 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:03:12,685 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:03:12,685 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:03:12,685 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:03:12,685 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:03:12,685 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:03:12,685 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:03:12,686 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:03:12,686 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:03:12,686 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:03:12,686 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:03:12,686 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:03:12,686 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:03:12,686 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:03:12,686 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:03:12,686 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:03:12,686 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:03:13,037 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:03:13,038 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 30 [2019-10-06 23:03:13,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-06 23:03:13,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-06 23:03:13,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2019-10-06 23:03:13,040 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 30 states. [2019-10-06 23:03:13,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:03:13,781 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2019-10-06 23:03:13,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-06 23:03:13,781 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-10-06 23:03:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:03:13,782 INFO L225 Difference]: With dead ends: 166 [2019-10-06 23:03:13,782 INFO L226 Difference]: Without dead ends: 77 [2019-10-06 23:03:13,784 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 175 SyntacticMatches, 10 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2019-10-06 23:03:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-06 23:03:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-10-06 23:03:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-06 23:03:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-10-06 23:03:13,792 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 67 [2019-10-06 23:03:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:03:13,792 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-10-06 23:03:13,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-06 23:03:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-10-06 23:03:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-06 23:03:13,793 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:03:13,793 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:03:13,994 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:03:13,994 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:03:13,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:03:13,995 INFO L82 PathProgramCache]: Analyzing trace with hash 994799840, now seen corresponding path program 12 times [2019-10-06 23:03:13,995 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:03:13,996 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:03:13,996 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:03:13,996 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:03:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:03:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:03:15,539 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 37 [2019-10-06 23:03:15,963 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 40 [2019-10-06 23:03:16,323 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 40 [2019-10-06 23:03:16,673 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 41 [2019-10-06 23:03:17,005 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 38 [2019-10-06 23:03:17,336 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 36 [2019-10-06 23:03:17,686 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 39 [2019-10-06 23:03:18,022 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 36 [2019-10-06 23:03:18,335 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 34 [2019-10-06 23:03:18,603 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 25 [2019-10-06 23:03:18,841 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 19 [2019-10-06 23:03:19,315 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 35 [2019-10-06 23:03:19,944 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 40 [2019-10-06 23:03:20,186 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 36 [2019-10-06 23:03:20,400 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 35 [2019-10-06 23:03:20,578 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 25 [2019-10-06 23:03:20,739 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 19 [2019-10-06 23:03:20,889 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 25 [2019-10-06 23:03:21,097 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2019-10-06 23:03:21,313 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 38 [2019-10-06 23:03:21,524 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2019-10-06 23:03:21,734 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 41 [2019-10-06 23:03:21,928 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-10-06 23:03:22,140 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 38 [2019-10-06 23:03:22,323 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-10-06 23:03:22,490 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-10-06 23:03:22,651 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2019-10-06 23:03:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 3 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:03:23,705 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:03:23,705 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:03:23,705 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:03:23,961 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:03:23,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:03:23,970 WARN L254 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 210 conjunts are in the unsatisfiable core [2019-10-06 23:03:23,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:03:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-06 23:03:25,317 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:03:27,614 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 127