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_sum_m4.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:16:08,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:16:08,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:16:08,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:16:08,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:16:08,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:16:08,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:16:08,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:16:08,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:16:08,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:16:08,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:16:08,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:16:08,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:16:08,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:16:08,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:16:08,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:16:08,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:16:08,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:16:08,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:16:08,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:16:08,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:16:08,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:16:08,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:16:08,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:16:08,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:16:08,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:16:08,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:16:08,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:16:08,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:16:08,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:16:08,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:16:08,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:16:08,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:16:08,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:16:08,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:16:08,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:16:08,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:16:08,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:16:08,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:16:08,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:16:08,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:16:08,874 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-06 23:16:08,886 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:16:08,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:16:08,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:16:08,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:16:08,888 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:16:08,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:16:08,889 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:16:08,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:16:08,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:16:08,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:16:08,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:16:08,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:16:08,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:16:08,890 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:16:08,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:16:08,890 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:16:08,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:16:08,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:16:08,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:16:08,891 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:16:08,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:16:08,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:16:08,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:16:08,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:16:08,892 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:16:08,892 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:16:08,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:16:08,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:16:08,893 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-06 23:16:09,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:16:09,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:16:09,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:16:09,178 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:16:09,179 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:16:09,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_m4.c [2019-10-06 23:16:09,240 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1031be334/a8783ded50e54bc8bc1ec27276660e5d/FLAGe27ae55c4 [2019-10-06 23:16:09,713 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:16:09,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_m4.c [2019-10-06 23:16:09,721 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1031be334/a8783ded50e54bc8bc1ec27276660e5d/FLAGe27ae55c4 [2019-10-06 23:16:10,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1031be334/a8783ded50e54bc8bc1ec27276660e5d [2019-10-06 23:16:10,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:16:10,090 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:16:10,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:16:10,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:16:10,099 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:16:10,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:16:10" (1/1) ... [2019-10-06 23:16:10,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfc0887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:10, skipping insertion in model container [2019-10-06 23:16:10,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:16:10" (1/1) ... [2019-10-06 23:16:10,111 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:16:10,132 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:16:10,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:16:10,358 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:16:10,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:16:10,496 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:16:10,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:10 WrapperNode [2019-10-06 23:16:10,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:16:10,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:16:10,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:16:10,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:16:10,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:10" (1/1) ... [2019-10-06 23:16:10,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:10" (1/1) ... [2019-10-06 23:16:10,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:10" (1/1) ... [2019-10-06 23:16:10,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:10" (1/1) ... [2019-10-06 23:16:10,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:10" (1/1) ... [2019-10-06 23:16:10,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:10" (1/1) ... [2019-10-06 23:16:10,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:10" (1/1) ... [2019-10-06 23:16:10,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:16:10,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:16:10,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:16:10,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:16:10,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:16:10,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:16:10,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:16:10,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:16:10,612 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:16:10,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:16:10,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-06 23:16:10,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:16:10,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-10-06 23:16:10,613 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:16:10,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:16:10,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:16:10,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:16:10,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:16:10,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:16:10,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:16:11,164 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:16:11,165 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-06 23:16:11,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:16:11 BoogieIcfgContainer [2019-10-06 23:16:11,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:16:11,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:16:11,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:16:11,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:16:11,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:16:10" (1/3) ... [2019-10-06 23:16:11,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13deb467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:16:11, skipping insertion in model container [2019-10-06 23:16:11,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:10" (2/3) ... [2019-10-06 23:16:11,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13deb467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:16:11, skipping insertion in model container [2019-10-06 23:16:11,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:16:11" (3/3) ... [2019-10-06 23:16:11,175 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum_m4.c [2019-10-06 23:16:11,185 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:16:11,193 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:16:11,206 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:16:11,234 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:16:11,234 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:16:11,235 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:16:11,235 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:16:11,236 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:16:11,236 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:16:11,236 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:16:11,236 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:16:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-06 23:16:11,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-06 23:16:11,264 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:11,265 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:11,267 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:11,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:11,274 INFO L82 PathProgramCache]: Analyzing trace with hash 936704280, now seen corresponding path program 1 times [2019-10-06 23:16:11,284 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:11,284 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:11,285 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:11,285 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:11,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:16:11,513 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:11,513 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:11,514 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-06 23:16:11,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-06 23:16:11,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-06 23:16:11,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-06 23:16:11,531 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2019-10-06 23:16:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:11,641 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2019-10-06 23:16:11,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-06 23:16:11,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-06 23:16:11,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:11,653 INFO L225 Difference]: With dead ends: 52 [2019-10-06 23:16:11,653 INFO L226 Difference]: Without dead ends: 28 [2019-10-06 23:16:11,656 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:16:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-06 23:16:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-06 23:16:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-06 23:16:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 43 transitions. [2019-10-06 23:16:11,695 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 43 transitions. Word has length 19 [2019-10-06 23:16:11,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:11,696 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 43 transitions. [2019-10-06 23:16:11,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-06 23:16:11,697 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 43 transitions. [2019-10-06 23:16:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-06 23:16:11,698 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:11,698 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] [2019-10-06 23:16:11,698 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:11,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:11,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1654172677, now seen corresponding path program 1 times [2019-10-06 23:16:11,699 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:11,699 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:11,699 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:11,700 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:11,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:16:11,764 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:11,764 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:11,765 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:16:11,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:16:11,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:16:11,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:16:11,767 INFO L87 Difference]: Start difference. First operand 28 states and 43 transitions. Second operand 3 states. [2019-10-06 23:16:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:11,842 INFO L93 Difference]: Finished difference Result 50 states and 80 transitions. [2019-10-06 23:16:11,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:16:11,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-06 23:16:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:11,844 INFO L225 Difference]: With dead ends: 50 [2019-10-06 23:16:11,844 INFO L226 Difference]: Without dead ends: 29 [2019-10-06 23:16:11,845 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:16:11,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-06 23:16:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-06 23:16:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-06 23:16:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2019-10-06 23:16:11,853 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 44 transitions. Word has length 20 [2019-10-06 23:16:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:11,854 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 44 transitions. [2019-10-06 23:16:11,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:16:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 44 transitions. [2019-10-06 23:16:11,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:16:11,855 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:11,856 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:16:11,856 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:11,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:11,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2052158869, now seen corresponding path program 1 times [2019-10-06 23:16:11,857 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:11,857 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:11,857 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:11,858 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:11,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:11,931 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:16:11,931 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:11,932 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:11,932 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-06 23:16:11,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-06 23:16:11,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-06 23:16:11,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:16:11,933 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. Second operand 4 states. [2019-10-06 23:16:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:12,045 INFO L93 Difference]: Finished difference Result 48 states and 76 transitions. [2019-10-06 23:16:12,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:16:12,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-06 23:16:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:12,047 INFO L225 Difference]: With dead ends: 48 [2019-10-06 23:16:12,047 INFO L226 Difference]: Without dead ends: 29 [2019-10-06 23:16:12,048 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:16:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-06 23:16:12,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-06 23:16:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-06 23:16:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2019-10-06 23:16:12,056 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 21 [2019-10-06 23:16:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:12,056 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-10-06 23:16:12,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-06 23:16:12,056 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2019-10-06 23:16:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-06 23:16:12,057 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:12,058 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] [2019-10-06 23:16:12,058 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1641054906, now seen corresponding path program 1 times [2019-10-06 23:16:12,059 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:12,059 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:12,059 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:12,059 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:12,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-06 23:16:12,167 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:12,168 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:12,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:12,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:16:12,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-06 23:16:12,283 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-06 23:16:12,320 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:12,349 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:16:12,349 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:12,356 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:12,365 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:12,366 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:12,609 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:16:13,146 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:13,168 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:13,175 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:13,176 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:13,176 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:16:13,177 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:13,177 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:16:13,177 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:16:13,178 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:13,178 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:13,178 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:13,179 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:13,179 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:13,179 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:16:13,180 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:16:13,180 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:16:13,181 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(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:16:13,181 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:16:13,181 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:13,182 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:16:13,182 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:13,182 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:13,183 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:16:13,183 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:13,616 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:13,617 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 11] total 19 [2019-10-06 23:16:13,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-06 23:16:13,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-06 23:16:13,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-10-06 23:16:13,620 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 19 states. [2019-10-06 23:16:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:14,088 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-10-06 23:16:14,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-06 23:16:14,089 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2019-10-06 23:16:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:14,090 INFO L225 Difference]: With dead ends: 59 [2019-10-06 23:16:14,090 INFO L226 Difference]: Without dead ends: 38 [2019-10-06 23:16:14,091 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 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:16:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-06 23:16:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-06 23:16:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-06 23:16:14,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-10-06 23:16:14,106 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 28 [2019-10-06 23:16:14,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:14,106 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-10-06 23:16:14,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-06 23:16:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-10-06 23:16:14,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-06 23:16:14,110 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:14,110 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-06 23:16:14,315 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:14,316 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:14,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:14,316 INFO L82 PathProgramCache]: Analyzing trace with hash 939463896, now seen corresponding path program 2 times [2019-10-06 23:16:14,317 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:14,317 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:14,317 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:14,318 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:14,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:16:15,884 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:15,885 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:15,885 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:16:15,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:16:15,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:16:15,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 79 conjunts are in the unsatisfiable core [2019-10-06 23:16:15,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:16:16,660 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:16:17,947 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:17,949 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:16:17,949 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:17,950 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:17,950 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:17,950 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:17,989 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:16:18,408 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:18,437 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:18,444 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:18,444 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:18,445 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:16:18,445 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:18,446 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:16:18,447 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:16:18,447 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:18,447 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:18,449 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:18,449 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:18,450 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:18,450 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:16:18,460 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:16:18,460 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:16:18,461 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(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:16:18,461 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:16:18,461 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:18,461 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:16:18,462 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:18,462 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:18,462 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(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:16:18,463 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:19,481 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:19,482 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 11] total 65 [2019-10-06 23:16:19,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-06 23:16:19,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-06 23:16:19,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3958, Unknown=0, NotChecked=0, Total=4160 [2019-10-06 23:16:19,490 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 65 states. [2019-10-06 23:16:22,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:22,006 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2019-10-06 23:16:22,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-06 23:16:22,007 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 37 [2019-10-06 23:16:22,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:22,009 INFO L225 Difference]: With dead ends: 65 [2019-10-06 23:16:22,009 INFO L226 Difference]: Without dead ends: 60 [2019-10-06 23:16:22,011 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 64 SyntacticMatches, 14 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1476 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=283, Invalid=5569, Unknown=0, NotChecked=0, Total=5852 [2019-10-06 23:16:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-06 23:16:22,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-10-06 23:16:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-06 23:16:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2019-10-06 23:16:22,021 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 37 [2019-10-06 23:16:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:22,022 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2019-10-06 23:16:22,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-06 23:16:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2019-10-06 23:16:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-06 23:16:22,023 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:22,023 INFO L385 BasicCegarLoop]: trace histogram [3, 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] [2019-10-06 23:16:22,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:22,227 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:22,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:22,228 INFO L82 PathProgramCache]: Analyzing trace with hash -944115259, now seen corresponding path program 3 times [2019-10-06 23:16:22,229 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:22,229 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:22,229 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:22,230 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:22,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:16:22,290 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:22,290 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:22,290 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:16:22,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:16:22,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:16:22,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:16:22,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:16:22,492 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:16:22,561 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:22,563 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:16:22,564 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:22,564 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:22,564 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:22,565 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:22,593 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:16:22,864 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:22,877 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:22,881 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:22,882 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:22,882 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:16:22,882 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:22,883 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:16:22,883 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:16:22,883 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:22,883 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:22,883 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:22,883 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:22,884 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:22,885 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:16:22,886 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:16:22,886 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:16:22,886 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(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:16:22,886 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:16:22,886 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:22,887 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:16:22,887 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:22,887 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:22,887 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:16:22,887 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:23,288 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:23,288 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9, 11] total 27 [2019-10-06 23:16:23,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-06 23:16:23,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-06 23:16:23,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-10-06 23:16:23,291 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand 27 states. [2019-10-06 23:16:24,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:24,692 INFO L93 Difference]: Finished difference Result 145 states and 195 transitions. [2019-10-06 23:16:24,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-06 23:16:24,693 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 38 [2019-10-06 23:16:24,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:24,701 INFO L225 Difference]: With dead ends: 145 [2019-10-06 23:16:24,701 INFO L226 Difference]: Without dead ends: 118 [2019-10-06 23:16:24,706 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=271, Invalid=1891, Unknown=0, NotChecked=0, Total=2162 [2019-10-06 23:16:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-06 23:16:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 65. [2019-10-06 23:16:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-06 23:16:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2019-10-06 23:16:24,727 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 38 [2019-10-06 23:16:24,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:24,727 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2019-10-06 23:16:24,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-06 23:16:24,728 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2019-10-06 23:16:24,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-06 23:16:24,729 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:24,729 INFO L385 BasicCegarLoop]: trace histogram [3, 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] [2019-10-06 23:16:24,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:24,942 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:24,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1243861118, now seen corresponding path program 4 times [2019-10-06 23:16:24,943 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:24,943 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:24,943 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:24,943 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:24,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:16:25,044 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:25,044 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:25,044 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:16:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:25,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:16:25,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:16:25,252 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:16:25,309 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:25,310 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:16:25,311 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:25,312 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:25,313 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:25,313 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:25,334 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:16:25,548 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:25,560 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:25,565 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:25,566 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:25,566 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:16:25,566 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:25,566 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:16:25,567 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:16:25,567 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:25,567 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:25,567 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:25,567 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:25,568 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:25,568 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:16:25,568 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:16:25,568 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:16:25,568 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(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:16:25,569 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:16:25,569 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:25,569 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:16:25,571 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:25,571 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:25,571 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:16:25,571 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:26,007 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:26,007 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 26 [2019-10-06 23:16:26,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-06 23:16:26,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-06 23:16:26,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2019-10-06 23:16:26,009 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 26 states. [2019-10-06 23:16:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:26,775 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2019-10-06 23:16:26,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-06 23:16:26,775 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2019-10-06 23:16:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:26,776 INFO L225 Difference]: With dead ends: 122 [2019-10-06 23:16:26,777 INFO L226 Difference]: Without dead ends: 47 [2019-10-06 23:16:26,778 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2019-10-06 23:16:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-06 23:16:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-06 23:16:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-06 23:16:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-10-06 23:16:26,786 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 38 [2019-10-06 23:16:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:26,786 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-10-06 23:16:26,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-06 23:16:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-10-06 23:16:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-06 23:16:26,787 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:26,788 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-06 23:16:26,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:26,994 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:26,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:26,994 INFO L82 PathProgramCache]: Analyzing trace with hash 546226426, now seen corresponding path program 5 times [2019-10-06 23:16:26,994 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:26,994 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:26,994 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:26,994 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:26,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:27,726 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2019-10-06 23:16:27,876 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 34 [2019-10-06 23:16:28,026 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 32 [2019-10-06 23:16:28,167 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 29 [2019-10-06 23:16:28,402 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 41 [2019-10-06 23:16:28,568 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-10-06 23:16:28,760 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2019-10-06 23:16:28,914 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 32 [2019-10-06 23:16:29,107 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-10-06 23:16:29,261 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2019-10-06 23:16:29,409 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-10-06 23:16:29,557 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 32 [2019-10-06 23:16:29,724 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-10-06 23:16:29,898 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-10-06 23:16:30,062 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-10-06 23:16:30,199 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-10-06 23:16:30,384 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-10-06 23:16:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:16:31,772 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:31,772 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:31,772 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:16:31,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:16:31,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:16:31,896 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 118 conjunts are in the unsatisfiable core [2019-10-06 23:16:31,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:16:36,370 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:16:50,030 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:50,032 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:16:50,032 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:50,032 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:50,033 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:50,033 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:50,062 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:16:50,265 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:50,275 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:50,278 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:50,279 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:50,279 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:16:50,279 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:50,279 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:16:50,280 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:16:50,280 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:50,280 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:50,280 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:50,280 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:50,281 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:50,281 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:16:50,281 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:16:50,281 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:16:50,282 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(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:16:50,282 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:16:50,282 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:50,282 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:16:50,282 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:50,283 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:50,283 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:16:50,283 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:52,034 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:52,034 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 36, 35, 11] total 111 [2019-10-06 23:16:52,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-06 23:16:52,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-06 23:16:52,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=11669, Unknown=0, NotChecked=0, Total=12210 [2019-10-06 23:16:52,040 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 111 states. [2019-10-06 23:16:55,610 WARN L191 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 99 [2019-10-06 23:16:58,183 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 110 [2019-10-06 23:17:03,617 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 117 [2019-10-06 23:17:12,407 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 47 [2019-10-06 23:17:13,638 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 127 [2019-10-06 23:17:19,633 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 130 [2019-10-06 23:17:22,325 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 123 [2019-10-06 23:17:24,543 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 113 [2019-10-06 23:17:26,965 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 94 [2019-10-06 23:17:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:28,497 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2019-10-06 23:17:28,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-06 23:17:28,498 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 46 [2019-10-06 23:17:28,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:28,500 INFO L225 Difference]: With dead ends: 81 [2019-10-06 23:17:28,500 INFO L226 Difference]: Without dead ends: 76 [2019-10-06 23:17:28,506 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 58 SyntacticMatches, 11 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6445 ImplicationChecksByTransitivity, 52.7s TimeCoverageRelationStatistics Valid=1236, Invalid=21411, Unknown=3, NotChecked=0, Total=22650 [2019-10-06 23:17:28,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-06 23:17:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-10-06 23:17:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-06 23:17:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2019-10-06 23:17:28,521 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 46 [2019-10-06 23:17:28,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:28,522 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2019-10-06 23:17:28,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-06 23:17:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2019-10-06 23:17:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-06 23:17:28,523 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:28,524 INFO L385 BasicCegarLoop]: trace histogram [4, 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] [2019-10-06 23:17:28,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:28,728 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:28,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:28,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2058829319, now seen corresponding path program 6 times [2019-10-06 23:17:28,729 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:28,729 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:28,730 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:28,730 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:28,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:17:28,800 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:28,800 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:28,801 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:28,936 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:17:28,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:17:28,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:17:28,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:17:29,056 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:17:29,163 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:29,164 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:17:29,164 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:29,165 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:29,166 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:29,166 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:29,187 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:17:29,364 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:29,373 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:17:29,376 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:29,376 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:29,376 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:17:29,377 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:29,377 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:17:29,377 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:17:29,377 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:17:29,377 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:17:29,378 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:17:29,378 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:17:29,378 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:29,378 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:17:29,378 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:17:29,381 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:17:29,381 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(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:17:29,381 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:17:29,381 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:29,381 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:17:29,382 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:17:29,382 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:17:29,382 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:17:29,382 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:17:29,758 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:29,758 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11, 11] total 32 [2019-10-06 23:17:29,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-06 23:17:29,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-06 23:17:29,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2019-10-06 23:17:29,761 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand 32 states. [2019-10-06 23:17:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:31,546 INFO L93 Difference]: Finished difference Result 182 states and 232 transitions. [2019-10-06 23:17:31,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-06 23:17:31,546 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2019-10-06 23:17:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:31,548 INFO L225 Difference]: With dead ends: 182 [2019-10-06 23:17:31,548 INFO L226 Difference]: Without dead ends: 148 [2019-10-06 23:17:31,551 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 115 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=372, Invalid=2708, Unknown=0, NotChecked=0, Total=3080 [2019-10-06 23:17:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-06 23:17:31,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 80. [2019-10-06 23:17:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-06 23:17:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2019-10-06 23:17:31,569 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 47 [2019-10-06 23:17:31,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:31,569 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2019-10-06 23:17:31,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-06 23:17:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2019-10-06 23:17:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-06 23:17:31,570 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:31,570 INFO L385 BasicCegarLoop]: trace histogram [4, 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] [2019-10-06 23:17:31,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:31,774 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:31,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:31,775 INFO L82 PathProgramCache]: Analyzing trace with hash -549320800, now seen corresponding path program 7 times [2019-10-06 23:17:31,775 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:31,775 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:31,775 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:31,776 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:17:31,878 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:31,878 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:31,878 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:17:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:32,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:17:32,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:17:32,100 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:17:32,146 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:32,147 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:17:32,147 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:32,148 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:32,148 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:32,148 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:32,175 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:17:32,379 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:32,387 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:17:32,390 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:32,391 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:32,391 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:17:32,391 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:32,391 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:17:32,391 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:17:32,392 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:17:32,392 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:17:32,392 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:17:32,392 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:17:32,392 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:32,393 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:17:32,393 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:17:32,393 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:17:32,393 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(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:17:32,393 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:17:32,394 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:32,394 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:17:32,394 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:17:32,394 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:17:32,394 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:17:32,394 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:17:32,744 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:32,744 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 27 [2019-10-06 23:17:32,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-06 23:17:32,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-06 23:17:32,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-10-06 23:17:32,747 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand 27 states. [2019-10-06 23:17:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:33,416 INFO L93 Difference]: Finished difference Result 144 states and 171 transitions. [2019-10-06 23:17:33,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-06 23:17:33,420 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2019-10-06 23:17:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:33,421 INFO L225 Difference]: With dead ends: 144 [2019-10-06 23:17:33,422 INFO L226 Difference]: Without dead ends: 76 [2019-10-06 23:17:33,426 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 119 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2019-10-06 23:17:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-06 23:17:33,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-10-06 23:17:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-06 23:17:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2019-10-06 23:17:33,451 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 47 [2019-10-06 23:17:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:33,451 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2019-10-06 23:17:33,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-06 23:17:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2019-10-06 23:17:33,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-06 23:17:33,453 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:33,454 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-06 23:17:33,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:33,655 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:33,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:33,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1223148560, now seen corresponding path program 8 times [2019-10-06 23:17:33,656 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:33,656 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:33,656 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:33,656 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:33,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-06 23:17:33,728 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:33,728 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:33,728 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:17:33,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:17:33,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:17:33,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:17:33,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-06 23:17:33,961 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-06 23:17:34,031 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:34,033 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:17:34,033 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:34,034 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:34,034 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:34,034 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:34,058 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:17:34,286 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:34,298 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:17:34,307 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:34,307 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:34,307 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:17:34,307 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:34,308 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:17:34,308 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:17:34,308 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:17:34,309 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:17:34,309 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:17:34,309 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:17:34,309 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:34,310 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:17:34,310 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:17:34,310 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:17:34,310 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(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:17:34,311 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:17:34,311 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:34,311 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:17:34,311 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:17:34,312 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:17:34,312 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:17:34,312 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:17:34,708 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:34,709 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 27 [2019-10-06 23:17:34,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-06 23:17:34,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-06 23:17:34,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-10-06 23:17:34,711 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand 27 states. [2019-10-06 23:17:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:35,396 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2019-10-06 23:17:35,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-06 23:17:35,397 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-10-06 23:17:35,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:35,398 INFO L225 Difference]: With dead ends: 112 [2019-10-06 23:17:35,398 INFO L226 Difference]: Without dead ends: 56 [2019-10-06 23:17:35,399 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 121 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-10-06 23:17:35,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-06 23:17:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-10-06 23:17:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-06 23:17:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2019-10-06 23:17:35,408 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 48 [2019-10-06 23:17:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:35,409 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-10-06 23:17:35,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-06 23:17:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2019-10-06 23:17:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-06 23:17:35,409 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:35,410 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-06 23:17:35,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:35,611 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:35,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1490739352, now seen corresponding path program 9 times [2019-10-06 23:17:35,612 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:35,612 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:35,612 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:35,612 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:35,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:36,276 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 12 [2019-10-06 23:17:36,417 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 14 [2019-10-06 23:17:36,633 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 26 [2019-10-06 23:17:36,857 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 33 [2019-10-06 23:17:37,108 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-10-06 23:17:37,343 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 35 [2019-10-06 23:17:37,570 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 37 [2019-10-06 23:17:37,847 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 43 [2019-10-06 23:17:38,090 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 45 [2019-10-06 23:17:38,325 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2019-10-06 23:17:38,550 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 39 [2019-10-06 23:17:38,774 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 41 [2019-10-06 23:17:39,022 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 45 [2019-10-06 23:17:39,275 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 46 [2019-10-06 23:17:39,502 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2019-10-06 23:17:39,718 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 40 [2019-10-06 23:17:39,920 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2019-10-06 23:17:40,137 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2019-10-06 23:17:40,355 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-10-06 23:17:40,577 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2019-10-06 23:17:40,774 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-10-06 23:17:40,954 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2019-10-06 23:17:41,205 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-10-06 23:17:41,404 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-10-06 23:17:41,591 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-10-06 23:17:41,773 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2019-10-06 23:17:42,005 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-10-06 23:17:42,201 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-10-06 23:17:42,377 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-10-06 23:17:42,546 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-10-06 23:17:42,734 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-10-06 23:17:42,902 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-10-06 23:17:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 1 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:17:43,679 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:43,679 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:43,679 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:17:43,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:17:43,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:17:43,880 WARN L254 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 138 conjunts are in the unsatisfiable core [2019-10-06 23:17:43,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:17:46,224 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:02,394 WARN L191 SmtUtils]: Spent 8.04 s on a formula simplification. DAG size of input: 3391 DAG size of output: 34 [2019-10-06 23:18:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:18:02,548 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:02,549 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:18:02,550 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:02,550 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:02,550 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:02,550 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:02,567 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:18:02,803 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:18:02,811 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:18:02,815 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:02,815 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:02,815 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:18:02,815 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:18:02,815 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:18:02,816 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:18:02,816 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:18:02,816 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:18:02,816 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:18:02,816 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:18:02,816 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:18:02,817 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:18:02,817 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:18:02,817 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:18:02,817 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(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:18:02,817 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:18:02,817 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:02,818 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:18:02,818 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:18:02,818 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:18:02,818 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:18:02,819 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:18:04,246 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:04,247 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 39, 41, 11] total 129 [2019-10-06 23:18:04,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-10-06 23:18:04,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-10-06 23:18:04,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=15818, Unknown=0, NotChecked=0, Total=16512 [2019-10-06 23:18:04,253 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 129 states. [2019-10-06 23:18:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:17,197 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2019-10-06 23:18:17,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-06 23:18:17,197 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 55 [2019-10-06 23:18:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:17,199 INFO L225 Difference]: With dead ends: 97 [2019-10-06 23:18:17,199 INFO L226 Difference]: Without dead ends: 92 [2019-10-06 23:18:17,202 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 77 SyntacticMatches, 10 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9696 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=1552, Invalid=28204, Unknown=0, NotChecked=0, Total=29756 [2019-10-06 23:18:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-06 23:18:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2019-10-06 23:18:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-06 23:18:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2019-10-06 23:18:17,217 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 55 [2019-10-06 23:18:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:17,217 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2019-10-06 23:18:17,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-10-06 23:18:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2019-10-06 23:18:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-06 23:18:17,218 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:17,218 INFO L385 BasicCegarLoop]: trace histogram [5, 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] [2019-10-06 23:18:17,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:17,440 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:17,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:17,441 INFO L82 PathProgramCache]: Analyzing trace with hash -560470139, now seen corresponding path program 10 times [2019-10-06 23:18:17,441 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:17,441 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:17,441 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:17,442 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:17,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:18:17,539 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:17,539 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:17,539 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:18:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:17,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:18:17,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:18:17,824 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:17,869 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:18:17,869 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:17,870 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:18:17,870 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:17,871 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:17,871 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:17,871 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:17,889 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:18:18,090 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:18:18,098 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:18:18,101 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:18,101 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:18,101 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:18:18,101 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:18:18,102 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:18:18,102 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:18:18,102 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:18:18,102 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:18:18,102 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:18:18,103 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:18:18,103 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:18:18,103 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:18:18,103 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:18:18,103 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:18:18,104 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(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:18:18,104 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:18:18,104 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:18,104 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:18:18,104 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:18:18,104 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:18:18,104 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:18:18,105 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:18:18,475 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:18,476 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 11] total 29 [2019-10-06 23:18:18,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-06 23:18:18,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-06 23:18:18,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-10-06 23:18:18,477 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand 29 states. [2019-10-06 23:18:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:19,265 INFO L93 Difference]: Finished difference Result 170 states and 200 transitions. [2019-10-06 23:18:19,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-06 23:18:19,265 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-10-06 23:18:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:19,266 INFO L225 Difference]: With dead ends: 170 [2019-10-06 23:18:19,266 INFO L226 Difference]: Without dead ends: 89 [2019-10-06 23:18:19,267 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 144 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2019-10-06 23:18:19,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-06 23:18:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-10-06 23:18:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-06 23:18:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2019-10-06 23:18:19,282 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 56 [2019-10-06 23:18:19,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:19,283 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2019-10-06 23:18:19,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-06 23:18:19,283 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2019-10-06 23:18:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-06 23:18:19,284 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:19,284 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-06 23:18:19,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:19,487 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:19,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:19,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1304897813, now seen corresponding path program 11 times [2019-10-06 23:18:19,488 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:19,488 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:19,488 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:19,488 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:19,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-06 23:18:19,614 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:19,614 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:19,614 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:18:19,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:18:19,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:19,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:18:19,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-06 23:18:20,050 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-06 23:18:20,139 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:20,140 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:18:20,141 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:20,141 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:20,141 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:20,141 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:20,159 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:18:20,404 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:18:20,414 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:18:20,416 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:20,417 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:20,417 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:18:20,417 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:18:20,417 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:18:20,417 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:18:20,417 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:18:20,418 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:18:20,418 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:18:20,418 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:18:20,418 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:18:20,418 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:18:20,418 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:18:20,419 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:18:20,419 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(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:18:20,419 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:18:20,419 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:20,419 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:18:20,419 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:18:20,420 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:18:20,420 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:18:20,420 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:18:20,769 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:20,769 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 30 [2019-10-06 23:18:20,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-06 23:18:20,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-06 23:18:20,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2019-10-06 23:18:20,771 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand 30 states. [2019-10-06 23:18:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:21,573 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2019-10-06 23:18:21,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-06 23:18:21,573 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2019-10-06 23:18:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:21,574 INFO L225 Difference]: With dead ends: 132 [2019-10-06 23:18:21,574 INFO L226 Difference]: Without dead ends: 65 [2019-10-06 23:18:21,575 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 145 SyntacticMatches, 10 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2019-10-06 23:18:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-06 23:18:21,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-10-06 23:18:21,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-06 23:18:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-10-06 23:18:21,584 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 57 [2019-10-06 23:18:21,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:21,584 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-10-06 23:18:21,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-06 23:18:21,585 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-10-06 23:18:21,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-06 23:18:21,585 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:21,585 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-06 23:18:21,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:21,790 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:21,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:21,790 INFO L82 PathProgramCache]: Analyzing trace with hash 872042298, now seen corresponding path program 12 times [2019-10-06 23:18:21,791 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:21,791 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:21,791 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:21,791 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:21,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:22,847 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 35 [2019-10-06 23:18:23,170 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 38 [2019-10-06 23:18:23,537 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 42 [2019-10-06 23:18:23,823 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 41 [2019-10-06 23:18:24,096 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 38 [2019-10-06 23:18:24,348 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 35 [2019-10-06 23:18:24,668 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 48 [2019-10-06 23:18:24,992 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 47 [2019-10-06 23:18:25,305 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 48 [2019-10-06 23:18:25,597 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2019-10-06 23:18:25,873 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 43 [2019-10-06 23:18:26,124 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 41 [2019-10-06 23:18:26,420 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 50 [2019-10-06 23:18:26,704 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 51 [2019-10-06 23:18:26,998 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 50 [2019-10-06 23:18:27,259 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 47 [2019-10-06 23:18:27,540 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 44 [2019-10-06 23:18:27,768 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 42 [2019-10-06 23:18:28,036 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-10-06 23:18:28,305 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2019-10-06 23:18:28,585 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 51 [2019-10-06 23:18:28,838 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 47 [2019-10-06 23:18:29,084 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2019-10-06 23:18:29,277 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2019-10-06 23:18:29,518 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2019-10-06 23:18:29,756 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-10-06 23:18:29,979 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-10-06 23:18:30,183 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-10-06 23:18:30,409 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 41 [2019-10-06 23:18:30,618 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2019-10-06 23:18:30,824 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2019-10-06 23:18:31,037 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-10-06 23:18:31,223 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-10-06 23:18:31,447 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-10-06 23:18:31,618 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-10-06 23:18:31,789 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2019-10-06 23:18:31,959 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-10-06 23:18:32,122 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-10-06 23:18:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 3 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:18:32,972 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:32,972 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:32,972 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:18:33,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:18:33,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:33,226 WARN L254 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 170 conjunts are in the unsatisfiable core [2019-10-06 23:18:33,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-06 23:18:37,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:45,044 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 127