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_sum2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:01:30,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:01:30,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:01:30,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:01:30,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:01:30,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:01:30,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:01:30,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:01:30,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:01:30,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:01:30,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:01:30,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:01:30,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:01:30,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:01:30,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:01:30,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:01:30,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:01:30,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:01:30,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:01:30,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:01:30,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:01:30,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:01:30,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:01:30,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:01:30,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:01:30,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:01:30,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:01:30,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:01:30,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:01:30,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:01:30,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:01:30,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:01:30,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:01:30,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:01:30,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:01:30,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:01:30,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:01:30,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:01:30,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:01:30,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:01:30,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:01:30,952 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:01:30,984 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:01:30,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:01:30,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:01:30,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:01:30,991 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:01:30,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:01:30,992 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:01:30,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:01:30,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:01:30,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:01:30,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:01:30,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:01:30,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:01:30,993 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:01:30,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:01:30,993 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:01:30,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:01:30,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:01:30,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:01:30,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:01:30,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:01:30,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:01:30,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:01:30,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:01:30,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:01:30,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:01:30,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:01:30,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:01:30,996 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:01:31,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:01:31,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:01:31,292 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:01:31,293 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:01:31,294 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:01:31,295 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum2.c [2019-10-06 23:01:31,380 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dfa90455/fab908e84f6b49a98054453be094e64a/FLAGca0a4e6dd [2019-10-06 23:01:31,846 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:01:31,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum2.c [2019-10-06 23:01:31,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dfa90455/fab908e84f6b49a98054453be094e64a/FLAGca0a4e6dd [2019-10-06 23:01:32,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dfa90455/fab908e84f6b49a98054453be094e64a [2019-10-06 23:01:32,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:01:32,220 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:01:32,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:01:32,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:01:32,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:01:32,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:01:32" (1/1) ... [2019-10-06 23:01:32,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211aa4e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:32, skipping insertion in model container [2019-10-06 23:01:32,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:01:32" (1/1) ... [2019-10-06 23:01:32,237 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:01:32,257 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:01:32,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:01:32,527 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:01:32,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:01:32,595 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:01:32,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:32 WrapperNode [2019-10-06 23:01:32,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:01:32,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:01:32,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:01:32,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:01:32,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:32" (1/1) ... [2019-10-06 23:01:32,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:32" (1/1) ... [2019-10-06 23:01:32,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:32" (1/1) ... [2019-10-06 23:01:32,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:32" (1/1) ... [2019-10-06 23:01:32,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:32" (1/1) ... [2019-10-06 23:01:32,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:32" (1/1) ... [2019-10-06 23:01:32,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:32" (1/1) ... [2019-10-06 23:01:32,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:01:32,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:01:32,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:01:32,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:01:32,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:32" (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:01:32,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:01:32,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:01:32,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:01:32,796 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:01:32,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:01:32,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-06 23:01:32,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:01:32,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-10-06 23:01:32,797 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:01:32,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:01:32,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:01:32,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:01:32,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:01:32,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:01:32,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:01:33,234 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:01:33,235 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-06 23:01:33,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:01:33 BoogieIcfgContainer [2019-10-06 23:01:33,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:01:33,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:01:33,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:01:33,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:01:33,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:01:32" (1/3) ... [2019-10-06 23:01:33,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e43adc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:01:33, skipping insertion in model container [2019-10-06 23:01:33,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:32" (2/3) ... [2019-10-06 23:01:33,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e43adc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:01:33, skipping insertion in model container [2019-10-06 23:01:33,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:01:33" (3/3) ... [2019-10-06 23:01:33,245 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum2.c [2019-10-06 23:01:33,255 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:01:33,268 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:01:33,277 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:01:33,300 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:01:33,300 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:01:33,300 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:01:33,300 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:01:33,300 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:01:33,300 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:01:33,301 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:01:33,301 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:01:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-06 23:01:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-06 23:01:33,320 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:33,321 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:01:33,323 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:33,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:33,328 INFO L82 PathProgramCache]: Analyzing trace with hash -112684807, now seen corresponding path program 1 times [2019-10-06 23:01:33,335 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:33,335 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:33,336 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:33,336 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:33,560 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:01:33,561 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:33,562 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:01:33,563 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-06 23:01:33,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-06 23:01:33,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-06 23:01:33,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-06 23:01:33,580 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-10-06 23:01:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:33,682 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-10-06 23:01:33,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-06 23:01:33,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-06 23:01:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:33,694 INFO L225 Difference]: With dead ends: 44 [2019-10-06 23:01:33,694 INFO L226 Difference]: Without dead ends: 20 [2019-10-06 23:01:33,698 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:01:33,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-06 23:01:33,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-06 23:01:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-06 23:01:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-10-06 23:01:33,737 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 15 [2019-10-06 23:01:33,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:33,737 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-10-06 23:01:33,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-06 23:01:33,738 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2019-10-06 23:01:33,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-06 23:01:33,739 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:33,739 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:01:33,740 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:33,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:33,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1049806191, now seen corresponding path program 1 times [2019-10-06 23:01:33,740 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:33,741 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:33,741 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:33,741 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:33,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:33,800 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:01:33,801 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:33,801 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:01:33,801 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:01:33,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:01:33,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:01:33,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:01:33,805 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2019-10-06 23:01:33,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:33,854 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2019-10-06 23:01:33,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:01:33,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-06 23:01:33,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:33,856 INFO L225 Difference]: With dead ends: 34 [2019-10-06 23:01:33,856 INFO L226 Difference]: Without dead ends: 21 [2019-10-06 23:01:33,858 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:01:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-06 23:01:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-06 23:01:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:01:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-10-06 23:01:33,866 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 16 [2019-10-06 23:01:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:33,866 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-10-06 23:01:33,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:01:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2019-10-06 23:01:33,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-06 23:01:33,868 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:33,868 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:01:33,868 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:33,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:33,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2044317511, now seen corresponding path program 1 times [2019-10-06 23:01:33,871 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:33,871 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:33,872 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:33,872 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:33,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:33,985 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:01:33,985 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:33,986 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:01:33,986 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-06 23:01:33,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-06 23:01:33,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-06 23:01:33,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:01:33,987 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 4 states. [2019-10-06 23:01:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:34,051 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2019-10-06 23:01:34,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:01:34,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-06 23:01:34,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:34,053 INFO L225 Difference]: With dead ends: 32 [2019-10-06 23:01:34,054 INFO L226 Difference]: Without dead ends: 21 [2019-10-06 23:01:34,054 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:01:34,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-06 23:01:34,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-06 23:01:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:01:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-06 23:01:34,060 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 17 [2019-10-06 23:01:34,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:34,061 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-06 23:01:34,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-06 23:01:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-06 23:01:34,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-06 23:01:34,062 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:34,062 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:01:34,063 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:34,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:34,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1165736995, now seen corresponding path program 1 times [2019-10-06 23:01:34,064 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:34,064 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:34,064 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:34,065 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:34,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:01:34,191 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:34,191 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:01:34,191 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:01:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:34,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:01:34,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:01:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:01:34,308 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:01:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:01:34,346 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:01:34,371 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:01:34,372 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:01:34,378 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:01:34,385 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:01:34,386 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:01:34,569 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:01:35,020 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:01:35,039 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:01:35,046 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:01:35,047 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:01:35,047 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:01:35,047 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:01:35,048 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:01:35,048 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:01:35,048 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:01:35,049 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:01:35,049 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:01:35,049 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:01:35,049 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:01:35,050 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:01:35,050 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:01:35,050 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(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:01:35,050 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:01:35,051 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:01:35,051 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:01:35,051 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:01:35,430 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:01:35,430 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-06 23:01:35,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:01:35,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:01:35,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-10-06 23:01:35,433 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 17 states. [2019-10-06 23:01:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:35,731 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2019-10-06 23:01:35,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-06 23:01:35,732 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-10-06 23:01:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:35,733 INFO L225 Difference]: With dead ends: 35 [2019-10-06 23:01:35,733 INFO L226 Difference]: Without dead ends: 22 [2019-10-06 23:01:35,734 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-10-06 23:01:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-06 23:01:35,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-06 23:01:35,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-06 23:01:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-06 23:01:35,739 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 20 [2019-10-06 23:01:35,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:35,740 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-06 23:01:35,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:01:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-06 23:01:35,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:01:35,741 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:35,741 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:01:35,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:01:35,943 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:35,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:35,944 INFO L82 PathProgramCache]: Analyzing trace with hash 394462681, now seen corresponding path program 2 times [2019-10-06 23:01:35,944 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:35,945 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:35,945 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:35,945 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:35,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:01:36,014 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:36,014 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:01:36,014 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:01:36,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:01:36,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:01:36,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:01:36,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:01:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:01:36,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:01:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:01:36,174 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:01:36,175 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:01:36,176 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:01:36,176 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:01:36,177 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:01:36,177 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:01:36,245 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:01:36,546 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:01:36,567 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:01:36,584 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:01:36,584 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:01:36,585 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:01:36,585 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:01:36,586 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:01:36,586 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:01:36,586 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:01:36,587 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:01:36,587 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:01:36,587 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:01:36,587 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:01:36,587 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:01:36,588 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:01:36,588 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(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:01:36,588 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:01:36,588 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:01:36,596 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:01:36,597 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:01:36,971 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:01:36,971 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 18 [2019-10-06 23:01:36,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:01:36,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:01:36,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:01:36,974 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-06 23:01:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:37,336 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-10-06 23:01:37,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-06 23:01:37,337 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-10-06 23:01:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:37,338 INFO L225 Difference]: With dead ends: 37 [2019-10-06 23:01:37,338 INFO L226 Difference]: Without dead ends: 26 [2019-10-06 23:01:37,339 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2019-10-06 23:01:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-06 23:01:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-06 23:01:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-06 23:01:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-06 23:01:37,348 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 21 [2019-10-06 23:01:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:37,348 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-06 23:01:37,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:01:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-06 23:01:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-06 23:01:37,350 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:37,350 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:01:37,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:01:37,552 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:37,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:37,552 INFO L82 PathProgramCache]: Analyzing trace with hash 513164793, now seen corresponding path program 3 times [2019-10-06 23:01:37,553 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:37,553 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:37,553 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:37,553 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:37,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:01:38,050 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:38,050 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:01:38,050 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:01:38,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:01:38,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:01:38,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-06 23:01:38,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:01:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:01:38,296 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:01:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:01:38,601 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:01:38,603 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:01:38,603 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:01:38,603 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:01:38,604 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:01:38,604 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:01:38,633 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:01:38,807 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:01:38,821 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:01:38,826 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:01:38,826 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:01:38,826 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:01:38,826 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:01:38,827 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:01:38,827 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:01:38,827 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:01:38,827 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:01:38,828 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:01:38,828 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:01:38,828 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:01:38,828 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:01:38,828 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:01:38,829 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(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:01:38,829 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:01:38,829 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:01:38,829 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:01:38,830 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:01:39,469 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:01:39,470 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11, 11] total 33 [2019-10-06 23:01:39,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-06 23:01:39,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-06 23:01:39,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2019-10-06 23:01:39,472 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 33 states. [2019-10-06 23:01:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:40,238 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-10-06 23:01:40,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-06 23:01:40,238 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 25 [2019-10-06 23:01:40,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:40,239 INFO L225 Difference]: With dead ends: 41 [2019-10-06 23:01:40,239 INFO L226 Difference]: Without dead ends: 36 [2019-10-06 23:01:40,240 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 49 SyntacticMatches, 13 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2019-10-06 23:01:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-06 23:01:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-10-06 23:01:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-06 23:01:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-10-06 23:01:40,248 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 25 [2019-10-06 23:01:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:40,248 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-10-06 23:01:40,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-06 23:01:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-10-06 23:01:40,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-06 23:01:40,249 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:40,249 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:01:40,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:01:40,458 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:40,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:40,459 INFO L82 PathProgramCache]: Analyzing trace with hash -609919663, now seen corresponding path program 4 times [2019-10-06 23:01:40,459 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:40,460 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:40,460 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:40,460 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:40,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:01:40,541 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:40,541 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:01:40,541 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:01:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:40,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:01:40,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:01:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:01:40,710 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:01:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:01:40,765 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:01:40,778 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:01:40,778 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:01:40,779 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:01:40,779 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:01:40,779 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:01:40,805 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:01:40,952 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:01:40,964 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:01:40,968 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:01:40,968 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:01:40,969 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:01:40,969 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:01:40,969 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:01:40,969 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:01:40,970 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:01:40,970 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:01:40,970 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:01:40,970 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:01:40,970 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:01:40,971 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:01:40,971 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:01:40,971 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(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:01:40,971 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:01:40,971 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:01:40,972 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:01:40,972 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:01:41,353 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:01:41,353 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 26 [2019-10-06 23:01:41,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-06 23:01:41,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-06 23:01:41,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2019-10-06 23:01:41,355 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 26 states. [2019-10-06 23:01:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:41,958 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2019-10-06 23:01:41,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-06 23:01:41,959 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-10-06 23:01:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:41,961 INFO L225 Difference]: With dead ends: 79 [2019-10-06 23:01:41,961 INFO L226 Difference]: Without dead ends: 43 [2019-10-06 23:01:41,962 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2019-10-06 23:01:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-06 23:01:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2019-10-06 23:01:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-06 23:01:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-10-06 23:01:41,970 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 26 [2019-10-06 23:01:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:41,970 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-10-06 23:01:41,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-06 23:01:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2019-10-06 23:01:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-06 23:01:41,971 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:41,971 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:01:42,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:01:42,176 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:42,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:42,177 INFO L82 PathProgramCache]: Analyzing trace with hash 924814918, now seen corresponding path program 5 times [2019-10-06 23:01:42,177 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:42,177 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:42,178 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:42,178 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:42,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-06 23:01:42,256 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:42,256 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:01:42,256 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:01:42,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:01:42,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:01:42,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:01:42,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:01:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-06 23:01:42,432 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:01:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-06 23:01:42,500 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:01:42,502 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:01:42,502 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:01:42,502 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:01:42,502 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:01:42,503 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:01:42,527 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:01:42,692 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:01:42,703 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:01:42,707 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:01:42,707 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:01:42,707 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:01:42,707 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:01:42,708 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:01:42,708 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:01:42,709 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:01:42,710 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:01:42,710 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:01:42,710 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:01:42,710 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:01:42,711 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:01:42,711 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:01:42,711 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(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:01:42,711 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:01:42,713 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:01:42,713 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:01:42,714 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:01:43,066 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:01:43,066 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 26 [2019-10-06 23:01:43,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-06 23:01:43,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-06 23:01:43,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2019-10-06 23:01:43,069 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 26 states. [2019-10-06 23:01:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:43,609 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-10-06 23:01:43,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-06 23:01:43,610 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 27 [2019-10-06 23:01:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:43,611 INFO L225 Difference]: With dead ends: 42 [2019-10-06 23:01:43,611 INFO L226 Difference]: Without dead ends: 31 [2019-10-06 23:01:43,613 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=1074, Unknown=0, NotChecked=0, Total=1260 [2019-10-06 23:01:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-06 23:01:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-06 23:01:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-06 23:01:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-06 23:01:43,619 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 27 [2019-10-06 23:01:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:43,619 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-06 23:01:43,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-06 23:01:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-06 23:01:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-06 23:01:43,620 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:43,620 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:01:43,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:01:43,824 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:43,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:43,825 INFO L82 PathProgramCache]: Analyzing trace with hash -902503389, now seen corresponding path program 6 times [2019-10-06 23:01:43,825 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:43,825 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:43,826 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:43,826 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:43,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:01:45,570 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:45,570 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:01:45,570 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:01:45,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:01:45,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:01:45,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-06 23:01:45,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:01:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:01:46,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:01:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:01:46,966 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:01:46,968 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:01:46,968 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:01:46,968 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:01:46,968 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:01:46,969 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:01:46,998 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:01:47,146 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:01:47,155 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:01:47,158 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:01:47,159 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:01:47,159 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:01:47,159 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:01:47,160 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:01:47,161 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:01:47,161 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:01:47,161 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:01:47,161 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:01:47,162 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:01:47,162 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:01:47,163 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:01:47,164 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:01:47,164 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(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:01:47,164 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:01:47,164 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:01:47,164 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:01:47,164 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:01:47,749 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:01:47,749 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 13, 11] total 53 [2019-10-06 23:01:47,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-06 23:01:47,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-06 23:01:47,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2544, Unknown=0, NotChecked=0, Total=2756 [2019-10-06 23:01:47,752 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 53 states. [2019-10-06 23:01:49,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:49,905 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2019-10-06 23:01:49,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-06 23:01:49,905 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 30 [2019-10-06 23:01:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:49,906 INFO L225 Difference]: With dead ends: 83 [2019-10-06 23:01:49,907 INFO L226 Difference]: Without dead ends: 45 [2019-10-06 23:01:49,910 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1843 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=472, Invalid=5380, Unknown=0, NotChecked=0, Total=5852 [2019-10-06 23:01:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-06 23:01:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-10-06 23:01:49,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-06 23:01:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-10-06 23:01:49,916 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 30 [2019-10-06 23:01:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:49,917 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-10-06 23:01:49,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-06 23:01:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-10-06 23:01:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-06 23:01:49,918 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:49,918 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:01:50,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:01:50,121 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:50,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash -86102225, now seen corresponding path program 7 times [2019-10-06 23:01:50,122 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:50,123 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:50,123 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:50,123 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:50,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:01:50,210 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:50,210 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:01:50,210 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:01:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:50,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:01:50,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:01:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:01:50,421 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:01:50,515 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:01:50,515 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:01:50,516 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:01:50,517 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:01:50,517 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:01:50,517 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:01:50,517 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:01:50,546 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:01:50,685 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:01:50,694 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:01:50,698 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:01:50,698 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:01:50,698 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:01:50,698 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:01:50,699 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:01:50,699 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:01:50,699 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:01:50,699 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:01:50,699 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:01:50,700 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:01:50,700 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:01:50,701 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:01:50,701 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:01:50,701 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(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:01:50,701 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:01:50,701 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:01:50,702 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:01:50,702 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:01:51,071 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:01:51,071 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 34 [2019-10-06 23:01:51,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-06 23:01:51,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-06 23:01:51,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2019-10-06 23:01:51,074 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 34 states. [2019-10-06 23:01:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:51,647 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-10-06 23:01:51,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-06 23:01:51,648 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 32 [2019-10-06 23:01:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:51,649 INFO L225 Difference]: With dead ends: 59 [2019-10-06 23:01:51,649 INFO L226 Difference]: Without dead ends: 36 [2019-10-06 23:01:51,651 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=271, Invalid=1709, Unknown=0, NotChecked=0, Total=1980 [2019-10-06 23:01:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-06 23:01:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-06 23:01:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-06 23:01:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-06 23:01:51,657 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 32 [2019-10-06 23:01:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:51,657 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-06 23:01:51,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-06 23:01:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-06 23:01:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-06 23:01:51,658 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:51,658 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:01:51,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:01:51,863 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:51,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:51,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1919390983, now seen corresponding path program 8 times [2019-10-06 23:01:51,864 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:51,864 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:51,864 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:51,864 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:51,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:52,636 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 26 [2019-10-06 23:01:52,771 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2019-10-06 23:01:53,027 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 34 [2019-10-06 23:01:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:01:54,396 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:54,396 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:01:54,397 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:01:54,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:01:54,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:01:54,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 82 conjunts are in the unsatisfiable core [2019-10-06 23:01:54,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:01:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:01:55,365 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:01:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:01:57,821 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:01:57,822 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:01:57,822 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:01:57,822 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:01:57,823 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:01:57,823 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:01:57,846 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:01:57,961 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:01:57,974 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:01:57,978 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:01:57,978 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:01:57,978 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:01:57,978 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:01:57,979 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:01:57,979 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:01:57,979 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:01:57,979 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:01:57,979 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:01:57,979 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:01:57,979 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:01:57,980 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:01:57,980 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:01:57,980 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(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:01:57,980 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:01:57,980 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:01:57,981 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:01:57,981 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:01:58,791 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:01:58,791 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 16, 11] total 64 [2019-10-06 23:01:58,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-06 23:01:58,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-06 23:01:58,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3784, Unknown=0, NotChecked=0, Total=4032 [2019-10-06 23:01:58,795 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 64 states. [2019-10-06 23:02:01,627 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-10-06 23:02:02,105 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-10-06 23:02:03,380 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-10-06 23:02:04,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:04,772 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-10-06 23:02:04,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-06 23:02:04,773 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 35 [2019-10-06 23:02:04,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:04,776 INFO L225 Difference]: With dead ends: 85 [2019-10-06 23:02:04,776 INFO L226 Difference]: Without dead ends: 79 [2019-10-06 23:02:04,779 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 59 SyntacticMatches, 13 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3037 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=728, Invalid=9984, Unknown=0, NotChecked=0, Total=10712 [2019-10-06 23:02:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-06 23:02:04,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2019-10-06 23:02:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-06 23:02:04,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-10-06 23:02:04,790 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 35 [2019-10-06 23:02:04,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:04,791 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-10-06 23:02:04,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-06 23:02:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-10-06 23:02:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-06 23:02:04,792 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:04,792 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:04,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:04,996 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:04,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:04,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1412947951, now seen corresponding path program 9 times [2019-10-06 23:02:04,997 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:04,997 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:04,998 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:04,998 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:04,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-06 23:02:05,079 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:05,079 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:05,079 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:02:05,212 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:02:05,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:02:05,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:02:05,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-06 23:02:05,292 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-06 23:02:05,355 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:05,356 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:02:05,356 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:05,356 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:05,357 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:05,357 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:05,376 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:02:05,486 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:05,494 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:05,498 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:05,498 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:05,498 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:02:05,498 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:05,498 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:05,499 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:05,499 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:05,499 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:05,499 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:05,499 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:05,499 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:05,500 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:05,500 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:02:05,500 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:05,500 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:05,500 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:05,500 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:05,500 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:02:06,013 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:06,013 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 30 [2019-10-06 23:02:06,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-06 23:02:06,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-06 23:02:06,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2019-10-06 23:02:06,014 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 30 states. [2019-10-06 23:02:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:06,817 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2019-10-06 23:02:06,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-06 23:02:06,817 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-10-06 23:02:06,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:06,818 INFO L225 Difference]: With dead ends: 99 [2019-10-06 23:02:06,818 INFO L226 Difference]: Without dead ends: 68 [2019-10-06 23:02:06,819 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 83 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=313, Invalid=1757, Unknown=0, NotChecked=0, Total=2070 [2019-10-06 23:02:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-06 23:02:06,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2019-10-06 23:02:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-06 23:02:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2019-10-06 23:02:06,831 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 36 [2019-10-06 23:02:06,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:06,831 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-10-06 23:02:06,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-06 23:02:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2019-10-06 23:02:06,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-06 23:02:06,832 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:06,833 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:07,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:07,037 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:07,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:07,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1207386250, now seen corresponding path program 10 times [2019-10-06 23:02:07,038 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:07,038 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:07,038 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:07,038 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:07,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-06 23:02:07,121 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:07,121 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:07,121 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:02:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:07,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:02:07,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-06 23:02:07,331 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-06 23:02:07,386 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:07,387 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:02:07,388 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:07,388 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:07,388 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:07,388 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:07,405 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:02:07,544 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:07,553 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:07,557 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:07,557 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:07,557 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:02:07,558 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:07,558 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:07,558 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:07,558 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:07,558 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:07,558 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:07,559 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:07,559 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:07,559 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:07,559 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:07,559 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:07,560 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:07,560 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:07,560 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:07,560 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:02:07,923 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:07,923 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 11] total 29 [2019-10-06 23:02:07,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-06 23:02:07,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-06 23:02:07,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-10-06 23:02:07,925 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 29 states. [2019-10-06 23:02:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:08,337 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2019-10-06 23:02:08,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-06 23:02:08,337 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-10-06 23:02:08,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:08,338 INFO L225 Difference]: With dead ends: 83 [2019-10-06 23:02:08,339 INFO L226 Difference]: Without dead ends: 50 [2019-10-06 23:02:08,340 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 87 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2019-10-06 23:02:08,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-06 23:02:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-06 23:02:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-06 23:02:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-10-06 23:02:08,349 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 37 [2019-10-06 23:02:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:08,349 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-10-06 23:02:08,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-06 23:02:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-10-06 23:02:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-06 23:02:08,350 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:08,350 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:08,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:08,561 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:08,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash 377734726, now seen corresponding path program 11 times [2019-10-06 23:02:08,562 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:08,562 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:08,562 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:08,563 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:08,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-06 23:02:08,683 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:08,683 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:08,683 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:02:08,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:02:08,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:02:08,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:02:08,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-06 23:02:08,994 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-06 23:02:09,094 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:09,095 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:02:09,095 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:09,095 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:09,096 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:09,096 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:09,117 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:02:09,253 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:09,260 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:09,263 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:09,263 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:09,263 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:02:09,264 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:09,264 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:09,264 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:09,265 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:09,265 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:09,265 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:09,265 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:09,266 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:09,266 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:09,266 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:09,266 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:09,266 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:09,266 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:09,266 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:09,267 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:02:09,626 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:09,626 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 34 [2019-10-06 23:02:09,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-06 23:02:09,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-06 23:02:09,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2019-10-06 23:02:09,628 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 34 states. [2019-10-06 23:02:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:10,426 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-10-06 23:02:10,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-06 23:02:10,427 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 37 [2019-10-06 23:02:10,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:10,427 INFO L225 Difference]: With dead ends: 56 [2019-10-06 23:02:10,427 INFO L226 Difference]: Without dead ends: 41 [2019-10-06 23:02:10,429 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 81 SyntacticMatches, 10 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=306, Invalid=1764, Unknown=0, NotChecked=0, Total=2070 [2019-10-06 23:02:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-06 23:02:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-06 23:02:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-06 23:02:10,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-10-06 23:02:10,436 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 37 [2019-10-06 23:02:10,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:10,437 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-10-06 23:02:10,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-06 23:02:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-10-06 23:02:10,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-06 23:02:10,438 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:10,438 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:10,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:10,642 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:10,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:10,642 INFO L82 PathProgramCache]: Analyzing trace with hash -11756509, now seen corresponding path program 12 times [2019-10-06 23:02:10,642 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:10,642 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:10,643 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:10,643 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:10,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:11,424 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 33 [2019-10-06 23:02:11,599 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2019-10-06 23:02:11,802 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2019-10-06 23:02:11,956 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2019-10-06 23:02:12,101 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2019-10-06 23:02:12,248 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-10-06 23:02:12,418 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2019-10-06 23:02:12,575 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 35 [2019-10-06 23:02:12,713 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2019-10-06 23:02:12,857 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-10-06 23:02:13,219 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-10-06 23:02:13,367 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-10-06 23:02:13,520 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-10-06 23:02:13,808 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-10-06 23:02:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:02:14,478 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:14,478 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:14,478 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:02:14,645 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:02:14,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:02:14,647 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 90 conjunts are in the unsatisfiable core [2019-10-06 23:02:14,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:15,444 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-06 23:02:15,444 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:17,048 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 127