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_sum4.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:02:13,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:02:13,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:02:13,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:02:13,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:02:13,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:02:13,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:02:13,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:02:13,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:02:13,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:02:13,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:02:13,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:02:13,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:02:13,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:02:13,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:02:13,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:02:13,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:02:13,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:02:13,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:02:13,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:02:13,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:02:13,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:02:13,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:02:13,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:02:13,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:02:13,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:02:13,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:02:13,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:02:13,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:02:13,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:02:13,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:02:13,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:02:13,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:02:13,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:02:13,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:02:13,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:02:13,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:02:13,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:02:13,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:02:13,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:02:13,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:02:13,921 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-06 23:02:13,941 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:02:13,942 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:02:13,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:02:13,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:02:13,946 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:02:13,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:02:13,946 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:02:13,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:02:13,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:02:13,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:02:13,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:02:13,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:02:13,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:02:13,949 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:02:13,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:02:13,950 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:02:13,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:02:13,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:02:13,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:02:13,950 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:02:13,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:02:13,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:02:13,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:02:13,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:02:13,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:02:13,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:02:13,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:02:13,952 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:02:13,952 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-06 23:02:14,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:02:14,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:02:14,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:02:14,248 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:02:14,248 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:02:14,249 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum4.c [2019-10-06 23:02:14,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d32929e/dc8be8b48a314bdfa26757c56a3bd118/FLAGcfc57bd19 [2019-10-06 23:02:14,787 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:02:14,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum4.c [2019-10-06 23:02:14,797 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d32929e/dc8be8b48a314bdfa26757c56a3bd118/FLAGcfc57bd19 [2019-10-06 23:02:15,190 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d32929e/dc8be8b48a314bdfa26757c56a3bd118 [2019-10-06 23:02:15,201 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:02:15,203 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:02:15,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:02:15,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:02:15,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:02:15,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:02:15" (1/1) ... [2019-10-06 23:02:15,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d002693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:15, skipping insertion in model container [2019-10-06 23:02:15,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:02:15" (1/1) ... [2019-10-06 23:02:15,220 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:02:15,240 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:02:15,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:02:15,457 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:02:15,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:02:15,593 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:02:15,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:15 WrapperNode [2019-10-06 23:02:15,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:02:15,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:02:15,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:02:15,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:02:15,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:15" (1/1) ... [2019-10-06 23:02:15,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:15" (1/1) ... [2019-10-06 23:02:15,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:15" (1/1) ... [2019-10-06 23:02:15,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:15" (1/1) ... [2019-10-06 23:02:15,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:15" (1/1) ... [2019-10-06 23:02:15,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:15" (1/1) ... [2019-10-06 23:02:15,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:15" (1/1) ... [2019-10-06 23:02:15,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:02:15,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:02:15,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:02:15,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:02:15,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:02:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:02:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:02:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:02:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:02:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:02:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-06 23:02:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:02:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-10-06 23:02:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:02:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:02:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:02:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:02:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:02:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:02:15,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:02:16,222 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:02:16,223 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-06 23:02:16,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:02:16 BoogieIcfgContainer [2019-10-06 23:02:16,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:02:16,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:02:16,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:02:16,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:02:16,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:02:15" (1/3) ... [2019-10-06 23:02:16,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ced06e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:02:16, skipping insertion in model container [2019-10-06 23:02:16,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:02:15" (2/3) ... [2019-10-06 23:02:16,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ced06e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:02:16, skipping insertion in model container [2019-10-06 23:02:16,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:02:16" (3/3) ... [2019-10-06 23:02:16,236 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum4.c [2019-10-06 23:02:16,245 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:02:16,251 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:02:16,261 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:02:16,283 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:02:16,283 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:02:16,283 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:02:16,284 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:02:16,284 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:02:16,284 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:02:16,284 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:02:16,284 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:02:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-06 23:02:16,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-06 23:02:16,306 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:16,307 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:16,309 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:16,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:16,314 INFO L82 PathProgramCache]: Analyzing trace with hash 936704280, now seen corresponding path program 1 times [2019-10-06 23:02:16,321 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:16,322 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:16,322 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:16,322 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:16,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:02:16,536 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:16,536 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:02:16,537 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-06 23:02:16,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-06 23:02:16,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-06 23:02:16,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-06 23:02:16,562 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2019-10-06 23:02:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:16,690 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2019-10-06 23:02:16,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-06 23:02:16,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-06 23:02:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:16,704 INFO L225 Difference]: With dead ends: 52 [2019-10-06 23:02:16,704 INFO L226 Difference]: Without dead ends: 28 [2019-10-06 23:02:16,708 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-06 23:02:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-06 23:02:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-06 23:02:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-06 23:02:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 43 transitions. [2019-10-06 23:02:16,754 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 43 transitions. Word has length 19 [2019-10-06 23:02:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:16,755 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 43 transitions. [2019-10-06 23:02:16,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-06 23:02:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 43 transitions. [2019-10-06 23:02:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-06 23:02:16,756 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:16,756 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:02:16,757 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:16,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:16,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1654172677, now seen corresponding path program 1 times [2019-10-06 23:02:16,758 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:16,758 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:16,758 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:16,758 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:16,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:02:16,842 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:16,842 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:02:16,843 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:02:16,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:02:16,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:02:16,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:02:16,848 INFO L87 Difference]: Start difference. First operand 28 states and 43 transitions. Second operand 3 states. [2019-10-06 23:02:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:16,922 INFO L93 Difference]: Finished difference Result 50 states and 80 transitions. [2019-10-06 23:02:16,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:02:16,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-06 23:02:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:16,924 INFO L225 Difference]: With dead ends: 50 [2019-10-06 23:02:16,924 INFO L226 Difference]: Without dead ends: 29 [2019-10-06 23:02:16,925 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:02:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-06 23:02:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-06 23:02:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-06 23:02:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2019-10-06 23:02:16,933 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 44 transitions. Word has length 20 [2019-10-06 23:02:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:16,934 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 44 transitions. [2019-10-06 23:02:16,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:02:16,934 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 44 transitions. [2019-10-06 23:02:16,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:02:16,935 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:16,935 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:16,936 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:16,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:16,936 INFO L82 PathProgramCache]: Analyzing trace with hash 2052158869, now seen corresponding path program 1 times [2019-10-06 23:02:16,937 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:16,937 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:16,937 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:16,937 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:16,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:02:17,024 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:17,024 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:02:17,024 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-06 23:02:17,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-06 23:02:17,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-06 23:02:17,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:02:17,026 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. Second operand 4 states. [2019-10-06 23:02:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:17,116 INFO L93 Difference]: Finished difference Result 48 states and 76 transitions. [2019-10-06 23:02:17,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:02:17,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-06 23:02:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:17,118 INFO L225 Difference]: With dead ends: 48 [2019-10-06 23:02:17,118 INFO L226 Difference]: Without dead ends: 29 [2019-10-06 23:02:17,119 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:02:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-06 23:02:17,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-06 23:02:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-06 23:02:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2019-10-06 23:02:17,127 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 21 [2019-10-06 23:02:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:17,128 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-10-06 23:02:17,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-06 23:02:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2019-10-06 23:02:17,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-06 23:02:17,129 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:17,130 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:17,130 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:17,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:17,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1641054906, now seen corresponding path program 1 times [2019-10-06 23:02:17,131 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:17,131 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:17,131 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:17,131 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:17,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-06 23:02:17,282 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:17,283 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:17,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:17,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:02:17,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-06 23:02:17,409 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:17,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-06 23:02:17,442 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:17,469 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:02:17,469 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:17,476 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:17,484 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:17,485 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:17,653 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:02:18,173 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:18,193 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:18,200 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:18,201 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:18,201 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:18,202 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:18,202 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:18,202 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:18,203 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:18,203 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:18,203 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:18,204 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:18,204 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:18,204 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:18,205 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:18,205 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:18,205 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:18,206 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:18,206 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:18,206 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:18,207 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:18,207 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:02:18,207 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:18,208 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:18,698 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:18,698 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 11] total 19 [2019-10-06 23:02:18,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-06 23:02:18,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-06 23:02:18,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-10-06 23:02:18,703 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 19 states. [2019-10-06 23:02:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:19,238 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-10-06 23:02:19,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-06 23:02:19,239 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2019-10-06 23:02:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:19,240 INFO L225 Difference]: With dead ends: 59 [2019-10-06 23:02:19,240 INFO L226 Difference]: Without dead ends: 38 [2019-10-06 23:02:19,241 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2019-10-06 23:02:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-06 23:02:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-06 23:02:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-06 23:02:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-10-06 23:02:19,251 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 28 [2019-10-06 23:02:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:19,252 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-10-06 23:02:19,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-06 23:02:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-10-06 23:02:19,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-06 23:02:19,253 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:19,253 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:19,463 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:19,464 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:19,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:19,464 INFO L82 PathProgramCache]: Analyzing trace with hash 939463896, now seen corresponding path program 2 times [2019-10-06 23:02:19,464 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:19,464 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:19,464 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:19,465 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:19,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:02:20,321 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:20,321 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:20,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:20,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:02:20,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:02:20,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 79 conjunts are in the unsatisfiable core [2019-10-06 23:02:20,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:02:20,832 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:02:21,106 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:21,111 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:02:21,111 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:21,112 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:21,113 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:21,118 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:21,161 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:02:21,541 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:21,557 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:21,562 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:21,563 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:21,563 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:21,563 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:21,563 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:21,564 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:21,564 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:21,564 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:21,565 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:21,565 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:21,566 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:21,566 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:21,574 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:21,575 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:21,575 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:21,575 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:21,575 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:21,576 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:21,576 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:21,576 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:02:21,577 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:21,577 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:22,113 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:22,113 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10, 11] total 32 [2019-10-06 23:02:22,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-06 23:02:22,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-06 23:02:22,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2019-10-06 23:02:22,115 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 32 states. [2019-10-06 23:02:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:23,100 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2019-10-06 23:02:23,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-06 23:02:23,100 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 37 [2019-10-06 23:02:23,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:23,102 INFO L225 Difference]: With dead ends: 65 [2019-10-06 23:02:23,102 INFO L226 Difference]: Without dead ends: 60 [2019-10-06 23:02:23,103 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 84 SyntacticMatches, 27 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=157, Invalid=1483, Unknown=0, NotChecked=0, Total=1640 [2019-10-06 23:02:23,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-06 23:02:23,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-10-06 23:02:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-06 23:02:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2019-10-06 23:02:23,113 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 37 [2019-10-06 23:02:23,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:23,113 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2019-10-06 23:02:23,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-06 23:02:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2019-10-06 23:02:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-06 23:02:23,115 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:23,115 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:23,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:23,319 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:23,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:23,320 INFO L82 PathProgramCache]: Analyzing trace with hash -944115259, now seen corresponding path program 3 times [2019-10-06 23:02:23,320 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:23,320 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:23,320 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:23,320 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:23,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:02:23,390 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:23,390 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:23,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:23,482 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:02:23,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:02:23,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:02:23,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:02:23,594 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:02:23,670 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:23,672 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:02:23,672 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:23,673 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:23,673 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:23,673 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:23,698 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:02:23,937 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:23,950 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:23,954 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:23,954 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:23,955 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:23,955 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:23,955 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:23,955 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:23,956 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:23,956 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:23,956 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:23,956 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:23,957 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:23,958 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:23,958 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:23,959 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:23,959 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:23,959 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:23,959 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:23,960 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:23,960 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:23,960 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:02:23,960 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:23,961 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:24,370 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:24,370 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9, 11] total 27 [2019-10-06 23:02:24,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-06 23:02:24,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-06 23:02:24,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-10-06 23:02:24,372 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand 27 states. [2019-10-06 23:02:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:25,873 INFO L93 Difference]: Finished difference Result 145 states and 195 transitions. [2019-10-06 23:02:25,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-06 23:02:25,873 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 38 [2019-10-06 23:02:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:25,878 INFO L225 Difference]: With dead ends: 145 [2019-10-06 23:02:25,878 INFO L226 Difference]: Without dead ends: 118 [2019-10-06 23:02:25,880 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=271, Invalid=1891, Unknown=0, NotChecked=0, Total=2162 [2019-10-06 23:02:25,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-06 23:02:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 65. [2019-10-06 23:02:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-06 23:02:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2019-10-06 23:02:25,893 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 38 [2019-10-06 23:02:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:25,893 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2019-10-06 23:02:25,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-06 23:02:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2019-10-06 23:02:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-06 23:02:25,894 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:25,895 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:26,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:26,098 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:26,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1243861118, now seen corresponding path program 4 times [2019-10-06 23:02:26,099 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:26,100 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:26,100 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:26,100 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:26,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:02:26,168 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:26,168 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:26,168 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:26,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:02:26,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:02:26,345 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:02:26,399 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:26,401 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:02:26,401 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:26,402 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:26,402 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:26,402 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:26,423 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:02:26,632 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:26,646 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:26,651 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:26,651 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:26,651 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:02:26,651 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:26,652 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:26,652 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:26,652 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:26,652 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:26,652 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:26,652 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:26,653 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:26,653 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:26,653 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:26,653 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:26,653 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:26,653 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:26,654 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:26,655 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:26,655 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:26,656 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:02:26,656 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:26,656 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:27,033 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:27,034 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 26 [2019-10-06 23:02:27,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-06 23:02:27,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-06 23:02:27,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2019-10-06 23:02:27,036 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 26 states. [2019-10-06 23:02:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:27,801 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2019-10-06 23:02:27,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-06 23:02:27,801 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2019-10-06 23:02:27,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:27,803 INFO L225 Difference]: With dead ends: 122 [2019-10-06 23:02:27,803 INFO L226 Difference]: Without dead ends: 47 [2019-10-06 23:02:27,809 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2019-10-06 23:02:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-06 23:02:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-06 23:02:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-06 23:02:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-10-06 23:02:27,820 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 38 [2019-10-06 23:02:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:27,820 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-10-06 23:02:27,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-06 23:02:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-10-06 23:02:27,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-06 23:02:27,824 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:27,825 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:28,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:28,026 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:28,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:28,027 INFO L82 PathProgramCache]: Analyzing trace with hash 546226426, now seen corresponding path program 5 times [2019-10-06 23:02:28,027 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:28,027 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:28,027 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:28,028 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:28,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:28,719 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 36 [2019-10-06 23:02:28,880 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2019-10-06 23:02:29,051 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2019-10-06 23:02:29,196 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2019-10-06 23:02:29,378 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 33 [2019-10-06 23:02:29,505 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2019-10-06 23:02:29,641 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 22 [2019-10-06 23:02:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:02:30,719 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:30,719 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:30,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:30,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:02:30,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:02:30,839 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 118 conjunts are in the unsatisfiable core [2019-10-06 23:02:30,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:02:31,927 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:34,643 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:02:34,643 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:34,645 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:02:34,645 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:34,646 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:34,646 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:34,646 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:34,671 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:02:34,853 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:34,862 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:34,865 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:34,865 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:34,866 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:34,866 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:34,866 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:34,866 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:34,867 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:34,867 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:34,867 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:34,867 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:34,867 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:34,867 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:34,868 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:34,868 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:34,868 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:34,868 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:34,868 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:34,869 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:34,869 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:34,869 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:02:34,869 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:34,869 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:35,585 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:35,585 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 16, 14, 11] total 56 [2019-10-06 23:02:35,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-06 23:02:35,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-06 23:02:35,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2860, Unknown=0, NotChecked=0, Total=3080 [2019-10-06 23:02:35,588 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 56 states. [2019-10-06 23:02:36,746 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2019-10-06 23:02:37,445 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 69 [2019-10-06 23:02:39,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:39,683 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2019-10-06 23:02:39,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-06 23:02:39,683 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 46 [2019-10-06 23:02:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:39,685 INFO L225 Difference]: With dead ends: 81 [2019-10-06 23:02:39,686 INFO L226 Difference]: Without dead ends: 76 [2019-10-06 23:02:39,688 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 75 SyntacticMatches, 49 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2566 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=474, Invalid=5226, Unknown=0, NotChecked=0, Total=5700 [2019-10-06 23:02:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-06 23:02:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-10-06 23:02:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-06 23:02:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2019-10-06 23:02:39,701 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 46 [2019-10-06 23:02:39,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:39,702 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2019-10-06 23:02:39,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-06 23:02:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2019-10-06 23:02:39,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-06 23:02:39,703 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:39,703 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:39,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:39,907 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:39,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:39,908 INFO L82 PathProgramCache]: Analyzing trace with hash 2058829319, now seen corresponding path program 6 times [2019-10-06 23:02:39,908 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:39,909 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:39,909 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:39,909 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:39,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:02:39,992 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:39,992 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:39,992 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:40,160 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:02:40,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:02:40,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:02:40,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:02:40,287 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:02:40,400 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:40,402 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:02:40,402 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:40,403 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:40,403 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:40,403 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:40,437 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:02:40,664 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:40,673 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:40,676 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:40,677 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:40,677 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:40,677 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:40,677 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:40,678 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:40,678 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:40,678 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:40,678 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:40,678 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:40,679 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:40,679 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:40,679 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:40,679 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:40,679 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:40,679 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:40,680 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:40,680 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:40,680 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:40,680 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:02:40,680 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:40,681 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:41,061 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:41,061 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11, 11] total 32 [2019-10-06 23:02:41,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-06 23:02:41,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-06 23:02:41,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2019-10-06 23:02:41,064 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand 32 states. [2019-10-06 23:02:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:42,934 INFO L93 Difference]: Finished difference Result 182 states and 232 transitions. [2019-10-06 23:02:42,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-06 23:02:42,935 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2019-10-06 23:02:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:42,936 INFO L225 Difference]: With dead ends: 182 [2019-10-06 23:02:42,936 INFO L226 Difference]: Without dead ends: 148 [2019-10-06 23:02:42,939 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 115 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=372, Invalid=2708, Unknown=0, NotChecked=0, Total=3080 [2019-10-06 23:02:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-06 23:02:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 80. [2019-10-06 23:02:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-06 23:02:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2019-10-06 23:02:42,976 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 47 [2019-10-06 23:02:42,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:42,976 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2019-10-06 23:02:42,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-06 23:02:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2019-10-06 23:02:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-06 23:02:42,981 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:42,982 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:43,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:43,185 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:43,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:43,186 INFO L82 PathProgramCache]: Analyzing trace with hash -549320800, now seen corresponding path program 7 times [2019-10-06 23:02:43,186 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:43,186 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:43,186 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:43,186 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:43,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:02:43,286 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:43,286 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:43,287 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:43,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:02:43,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:02:43,508 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:02:43,569 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:43,570 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:02:43,570 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:43,570 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:43,571 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:43,571 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:43,594 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:02:43,817 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:43,827 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:43,834 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:43,835 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:43,835 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:02:43,835 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:43,835 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:43,835 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:43,836 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:43,836 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:43,836 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:43,839 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:43,840 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:43,840 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:43,840 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:43,840 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:43,840 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:43,841 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:43,841 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:43,841 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:43,841 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:43,841 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:02:43,841 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:43,842 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:44,202 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:44,203 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 27 [2019-10-06 23:02:44,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-06 23:02:44,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-06 23:02:44,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-10-06 23:02:44,205 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand 27 states. [2019-10-06 23:02:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:44,843 INFO L93 Difference]: Finished difference Result 144 states and 171 transitions. [2019-10-06 23:02:44,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-06 23:02:44,844 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2019-10-06 23:02:44,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:44,845 INFO L225 Difference]: With dead ends: 144 [2019-10-06 23:02:44,845 INFO L226 Difference]: Without dead ends: 76 [2019-10-06 23:02:44,847 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 119 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2019-10-06 23:02:44,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-06 23:02:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-10-06 23:02:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-06 23:02:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2019-10-06 23:02:44,862 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 47 [2019-10-06 23:02:44,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:44,863 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2019-10-06 23:02:44,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-06 23:02:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2019-10-06 23:02:44,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-06 23:02:44,864 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:44,864 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:45,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:45,072 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:45,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:45,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1223148560, now seen corresponding path program 8 times [2019-10-06 23:02:45,073 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:45,073 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:45,074 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:45,074 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:45,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-06 23:02:45,151 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:45,151 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:45,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:45,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:02:45,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:02:45,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:02:45,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-06 23:02:45,396 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:02:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-06 23:02:45,458 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:02:45,459 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:02:45,459 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:02:45,459 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:02:45,460 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:02:45,460 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:02:45,478 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:02:45,729 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:02:45,736 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:02:45,739 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:02:45,740 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:02:45,740 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (<= ~SIZE~0 32767) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:02:45,740 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:45,740 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:02:45,740 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:02:45,740 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:02:45,740 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:02:45,741 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:02:45,741 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:02:45,741 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:02:45,741 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:45,741 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:45,742 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:02:45,742 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:02:45,742 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:02:45,742 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:02:45,742 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:02:45,742 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:02:45,743 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:02:45,743 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:02:45,743 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:02:46,086 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:02:46,086 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 27 [2019-10-06 23:02:46,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-06 23:02:46,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-06 23:02:46,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-10-06 23:02:46,089 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand 27 states. [2019-10-06 23:02:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:02:46,805 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2019-10-06 23:02:46,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-06 23:02:46,806 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-10-06 23:02:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:02:46,807 INFO L225 Difference]: With dead ends: 112 [2019-10-06 23:02:46,807 INFO L226 Difference]: Without dead ends: 56 [2019-10-06 23:02:46,809 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 121 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-10-06 23:02:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-06 23:02:46,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-10-06 23:02:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-06 23:02:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2019-10-06 23:02:46,816 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 48 [2019-10-06 23:02:46,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:02:46,816 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-10-06 23:02:46,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-06 23:02:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2019-10-06 23:02:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-06 23:02:46,817 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:02:46,818 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:02:47,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:02:47,022 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:02:47,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:02:47,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1490739352, now seen corresponding path program 9 times [2019-10-06 23:02:47,023 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:02:47,023 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:47,023 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:47,023 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:02:47,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:02:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:02:47,680 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 12 [2019-10-06 23:02:47,816 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 14 [2019-10-06 23:02:48,026 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 26 [2019-10-06 23:02:48,250 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 33 [2019-10-06 23:02:48,494 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-10-06 23:02:48,718 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 35 [2019-10-06 23:02:48,931 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 34 [2019-10-06 23:02:49,218 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 36 [2019-10-06 23:02:49,408 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 34 [2019-10-06 23:02:49,600 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 27 [2019-10-06 23:02:49,771 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 19 [2019-10-06 23:02:49,963 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 25 [2019-10-06 23:02:50,187 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2019-10-06 23:02:50,410 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 39 [2019-10-06 23:02:50,648 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 38 [2019-10-06 23:02:50,860 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2019-10-06 23:02:51,082 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2019-10-06 23:02:51,279 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2019-10-06 23:02:51,442 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2019-10-06 23:02:51,590 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 19 [2019-10-06 23:02:51,980 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2019-10-06 23:02:52,126 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-10-06 23:02:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 1 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:02:53,108 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:02:53,108 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:02:53,108 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:53,292 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:02:53,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:02:53,299 WARN L254 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 138 conjunts are in the unsatisfiable core [2019-10-06 23:02:53,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:02:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:02:54,049 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:03:06,459 WARN L191 SmtUtils]: Spent 8.04 s on a formula simplification. DAG size of input: 3214 DAG size of output: 34 [2019-10-06 23:03:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:03:06,563 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:03:06,564 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:03:06,564 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:03:06,565 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:03:06,565 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:03:06,565 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:03:06,585 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:03:06,774 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:03:06,783 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:03:06,787 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:03:06,787 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:03:06,788 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:03:06,788 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:03:06,788 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:03:06,792 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:03:06,792 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:03:06,792 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:03:06,793 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:03:06,793 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:03:06,793 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:03:06,793 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:03:06,794 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:03:06,794 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:03:06,794 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:03:06,794 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:03:06,795 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:03:06,795 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:03:06,795 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:03:06,795 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:03:06,795 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:03:06,796 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:03:07,472 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:03:07,473 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15, 15, 11] total 71 [2019-10-06 23:03:07,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-10-06 23:03:07,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-10-06 23:03:07,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=4575, Unknown=0, NotChecked=0, Total=4970 [2019-10-06 23:03:07,476 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 71 states. [2019-10-06 23:03:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:03:11,221 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2019-10-06 23:03:11,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-06 23:03:11,222 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 55 [2019-10-06 23:03:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:03:11,224 INFO L225 Difference]: With dead ends: 97 [2019-10-06 23:03:11,224 INFO L226 Difference]: Without dead ends: 92 [2019-10-06 23:03:11,227 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 109 SyntacticMatches, 36 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4843 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=767, Invalid=7789, Unknown=0, NotChecked=0, Total=8556 [2019-10-06 23:03:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-06 23:03:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2019-10-06 23:03:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-06 23:03:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2019-10-06 23:03:11,241 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 55 [2019-10-06 23:03:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:03:11,241 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2019-10-06 23:03:11,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-10-06 23:03:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2019-10-06 23:03:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-06 23:03:11,242 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:03:11,243 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:03:11,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:03:11,453 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:03:11,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:03:11,454 INFO L82 PathProgramCache]: Analyzing trace with hash -560470139, now seen corresponding path program 10 times [2019-10-06 23:03:11,454 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:03:11,454 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:03:11,454 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:03:11,454 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:03:11,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:03:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:03:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:03:11,540 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:03:11,541 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:03:11,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:03:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:03:11,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:03:11,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:03:11,836 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:03:11,836 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:03:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:03:11,907 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:03:11,908 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:03:11,908 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:03:11,909 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:03:11,909 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:03:11,909 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:03:11,928 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:03:12,099 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:03:12,108 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:03:12,112 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:03:12,113 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:03:12,113 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:03:12,113 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:03:12,114 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:03:12,114 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:03:12,114 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:03:12,115 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:03:12,115 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:03:12,115 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:03:12,115 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:03:12,115 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:03:12,116 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:03:12,116 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:03:12,116 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:03:12,116 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:03:12,117 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:03:12,117 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:03:12,117 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:03:12,117 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:03:12,117 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:03:12,118 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:03:12,743 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:03:12,743 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 11] total 29 [2019-10-06 23:03:12,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-06 23:03:12,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-06 23:03:12,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-10-06 23:03:12,745 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand 29 states. [2019-10-06 23:03:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:03:13,532 INFO L93 Difference]: Finished difference Result 170 states and 200 transitions. [2019-10-06 23:03:13,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-06 23:03:13,533 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-10-06 23:03:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:03:13,534 INFO L225 Difference]: With dead ends: 170 [2019-10-06 23:03:13,534 INFO L226 Difference]: Without dead ends: 89 [2019-10-06 23:03:13,536 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 144 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2019-10-06 23:03:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-06 23:03:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-10-06 23:03:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-06 23:03:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2019-10-06 23:03:13,549 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 56 [2019-10-06 23:03:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:03:13,549 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2019-10-06 23:03:13,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-06 23:03:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2019-10-06 23:03:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-06 23:03:13,550 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:03:13,550 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:03:13,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:03:13,756 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:03:13,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:03:13,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1304897813, now seen corresponding path program 11 times [2019-10-06 23:03:13,757 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:03:13,757 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:03:13,757 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:03:13,758 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:03:13,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:03:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:03:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-06 23:03:13,871 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:03:13,871 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:03:13,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:03:14,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:03:14,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:03:14,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:03:14,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:03:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-06 23:03:14,190 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:03:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-06 23:03:14,281 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:03:14,282 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:03:14,282 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:03:14,282 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:03:14,283 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:03:14,283 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:03:14,301 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:03:14,469 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:03:14,477 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:03:14,479 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:03:14,479 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:03:14,480 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:03:14,480 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:03:14,480 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:03:14,480 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:03:14,480 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 406#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:03:14,480 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:03:14,481 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:03:14,481 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:03:14,481 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 392#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:03:14,481 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:03:14,481 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:03:14,481 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:03:14,481 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:03:14,482 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:03:14,482 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:03:14,482 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:03:14,482 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:03:14,482 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 387#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:03:14,482 INFO L193 IcfgInterpreter]: Reachable states at location L57-4 satisfy 382#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:03:14,482 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:03:14,840 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:03:14,840 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 30 [2019-10-06 23:03:14,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-06 23:03:14,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-06 23:03:14,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2019-10-06 23:03:14,843 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand 30 states. [2019-10-06 23:03:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:03:15,694 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2019-10-06 23:03:15,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-06 23:03:15,695 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2019-10-06 23:03:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:03:15,696 INFO L225 Difference]: With dead ends: 132 [2019-10-06 23:03:15,696 INFO L226 Difference]: Without dead ends: 65 [2019-10-06 23:03:15,698 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 145 SyntacticMatches, 10 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2019-10-06 23:03:15,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-06 23:03:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-10-06 23:03:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-06 23:03:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-10-06 23:03:15,708 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 57 [2019-10-06 23:03:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:03:15,708 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-10-06 23:03:15,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-06 23:03:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-10-06 23:03:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-06 23:03:15,709 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:03:15,710 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:03:15,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:03:15,915 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:03:15,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:03:15,915 INFO L82 PathProgramCache]: Analyzing trace with hash 872042298, now seen corresponding path program 12 times [2019-10-06 23:03:15,915 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:03:15,916 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:03:15,916 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:03:15,916 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:03:15,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:03:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:03:16,909 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 35 [2019-10-06 23:03:17,230 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 38 [2019-10-06 23:03:17,550 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 42 [2019-10-06 23:03:17,842 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 41 [2019-10-06 23:03:18,126 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 38 [2019-10-06 23:03:18,418 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 35 [2019-10-06 23:03:18,725 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 41 [2019-10-06 23:03:19,026 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 38 [2019-10-06 23:03:19,312 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-10-06 23:03:19,530 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 25 [2019-10-06 23:03:19,742 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 19 [2019-10-06 23:03:20,132 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 35 [2019-10-06 23:03:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 3 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:03:22,006 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:03:22,006 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:03:22,006 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:03:22,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:03:22,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:03:22,254 WARN L254 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 170 conjunts are in the unsatisfiable core [2019-10-06 23:03:22,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:03:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-06 23:03:23,208 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:03:24,997 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 127