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-tiling/rewrev.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:53:20,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:53:20,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:53:20,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:53:20,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:53:20,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:53:20,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:53:20,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:53:20,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:53:20,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:53:20,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:53:20,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:53:20,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:53:20,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:53:20,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:53:20,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:53:20,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:53:20,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:53:20,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:53:20,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:53:20,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:53:20,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:53:20,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:53:20,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:53:20,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:53:20,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:53:20,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:53:20,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:53:20,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:53:20,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:53:20,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:53:20,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:53:20,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:53:20,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:53:20,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:53:20,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:53:20,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:53:20,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:53:20,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:53:20,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:53:20,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:53:20,147 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:53:20,171 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:53:20,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:53:20,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:53:20,175 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:53:20,175 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:53:20,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:53:20,176 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:53:20,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:53:20,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:53:20,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:53:20,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:53:20,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:53:20,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:53:20,177 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:53:20,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:53:20,177 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:53:20,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:53:20,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:53:20,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:53:20,178 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:53:20,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:53:20,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:53:20,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:53:20,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:53:20,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:53:20,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:53:20,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:53:20,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:53:20,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:53:20,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:53:20,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:53:20,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:53:20,481 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:53:20,481 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:53:20,482 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewrev.c [2019-10-07 00:53:20,553 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb5245f4/7fb823771ef549c6b93bb79319d7c535/FLAGbf6c6dca0 [2019-10-07 00:53:21,002 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:53:21,002 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewrev.c [2019-10-07 00:53:21,009 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb5245f4/7fb823771ef549c6b93bb79319d7c535/FLAGbf6c6dca0 [2019-10-07 00:53:21,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb5245f4/7fb823771ef549c6b93bb79319d7c535 [2019-10-07 00:53:21,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:53:21,392 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:53:21,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:53:21,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:53:21,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:53:21,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:53:21" (1/1) ... [2019-10-07 00:53:21,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e2977e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:53:21, skipping insertion in model container [2019-10-07 00:53:21,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:53:21" (1/1) ... [2019-10-07 00:53:21,410 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:53:21,427 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:53:21,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:53:21,609 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:53:21,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:53:21,639 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:53:21,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:53:21 WrapperNode [2019-10-07 00:53:21,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:53:21,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:53:21,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:53:21,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:53:21,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:53:21" (1/1) ... [2019-10-07 00:53:21,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:53:21" (1/1) ... [2019-10-07 00:53:21,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:53:21" (1/1) ... [2019-10-07 00:53:21,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:53:21" (1/1) ... [2019-10-07 00:53:21,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:53:21" (1/1) ... [2019-10-07 00:53:21,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:53:21" (1/1) ... [2019-10-07 00:53:21,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:53:21" (1/1) ... [2019-10-07 00:53:21,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:53:21,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:53:21,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:53:21,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:53:21,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:53:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:53:21,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:53:21,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:53:21,843 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:53:21,843 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:53:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:53:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 00:53:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:53:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:53:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 00:53:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:53:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 00:53:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:53:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:53:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:53:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:53:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:53:22,191 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:53:22,191 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 00:53:22,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:53:22 BoogieIcfgContainer [2019-10-07 00:53:22,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:53:22,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:53:22,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:53:22,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:53:22,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:53:21" (1/3) ... [2019-10-07 00:53:22,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b31ab78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:53:22, skipping insertion in model container [2019-10-07 00:53:22,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:53:21" (2/3) ... [2019-10-07 00:53:22,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b31ab78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:53:22, skipping insertion in model container [2019-10-07 00:53:22,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:53:22" (3/3) ... [2019-10-07 00:53:22,201 INFO L109 eAbstractionObserver]: Analyzing ICFG rewrev.c [2019-10-07 00:53:22,211 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:53:22,219 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:53:22,234 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:53:22,259 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:53:22,259 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:53:22,260 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:53:22,260 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:53:22,260 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:53:22,260 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:53:22,260 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:53:22,260 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:53:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-07 00:53:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:53:22,279 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:53:22,280 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:53:22,282 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:53:22,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:53:22,288 INFO L82 PathProgramCache]: Analyzing trace with hash 698834392, now seen corresponding path program 1 times [2019-10-07 00:53:22,297 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:53:22,297 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:53:22,297 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:53:22,298 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:53:22,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:53:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:53:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:53:22,452 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:53:22,453 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:53:22,453 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:53:22,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:53:22,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:53:22,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:53:22,472 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-10-07 00:53:22,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:53:22,519 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-10-07 00:53:22,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:53:22,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:53:22,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:53:22,529 INFO L225 Difference]: With dead ends: 36 [2019-10-07 00:53:22,530 INFO L226 Difference]: Without dead ends: 17 [2019-10-07 00:53:22,532 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:53:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-07 00:53:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-07 00:53:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-07 00:53:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-10-07 00:53:22,567 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-10-07 00:53:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:53:22,568 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-07 00:53:22,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:53:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-10-07 00:53:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:53:22,569 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:53:22,569 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:53:22,570 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:53:22,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:53:22,570 INFO L82 PathProgramCache]: Analyzing trace with hash -494855414, now seen corresponding path program 1 times [2019-10-07 00:53:22,571 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:53:22,571 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:53:22,571 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:53:22,572 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:53:22,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:53:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:53:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:53:22,643 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:53:22,643 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:53:22,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:53:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:53:22,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:53:22,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:53:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:53:22,745 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:53:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:53:22,765 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:53:22,789 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:53:22,789 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:53:22,795 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:53:22,804 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:53:22,804 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:53:23,068 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-07 00:53:23,753 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2019-10-07 00:53:23,773 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:53:23,784 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:53:23,784 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:53:23,785 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 90#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1))) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1)) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:53:23,786 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 99#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-07 00:53:23,786 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 38#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= ~SIZE~0 2147483647) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 100000 ~MAX~0)) [2019-10-07 00:53:23,786 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 85#(and (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1))) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1)) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:53:23,787 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-07 00:53:23,787 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 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) (<= 100000 ~MAX~0)) [2019-10-07 00:53:23,788 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 70#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0)) [2019-10-07 00:53:23,788 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 104#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-07 00:53:23,789 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:53:23,790 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 95#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1))) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1)) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:53:23,791 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 65#(and (or (and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= main_~val1~0 7) (= main_~a~0.offset |main_#t~malloc2.offset|) (<= ~SIZE~0 2147483647) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (store |old(#length)| |main_#t~malloc2.base| (* 4 ~SIZE~0)) |#length|) (<= 0 (+ main_~i~0 1)) (not (= |main_#t~malloc2.base| 0)) (<= 0 (+ ~SIZE~0 2147483648)) (= 0 (select |old(#valid)| 0)) (= main_~i~0 (+ ~SIZE~0 (- 2))) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= main_~low~0 2) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (= |#NULL.base| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3))) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~i~0 99998) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) [2019-10-07 00:53:23,792 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 80#(exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1))) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1)) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-07 00:53:23,792 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 75#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (< main_~i~0 ~SIZE~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (= |main_#t~mem5| (select (select |#memory_int| main_~a~0.base) (+ (* 4 main_~i~0) main_~a~0.offset))) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0)) [2019-10-07 00:53:24,374 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 34 [2019-10-07 00:53:24,508 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2019-10-07 00:53:24,669 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-10-07 00:53:24,764 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:53:24,764 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 15 [2019-10-07 00:53:24,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-07 00:53:24,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-07 00:53:24,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-10-07 00:53:24,771 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 15 states. [2019-10-07 00:53:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:53:25,345 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-10-07 00:53:25,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 00:53:25,345 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 13 [2019-10-07 00:53:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:53:25,349 INFO L225 Difference]: With dead ends: 39 [2019-10-07 00:53:25,352 INFO L226 Difference]: Without dead ends: 30 [2019-10-07 00:53:25,354 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-10-07 00:53:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-07 00:53:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2019-10-07 00:53:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 00:53:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-07 00:53:25,376 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-10-07 00:53:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:53:25,377 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-07 00:53:25,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-07 00:53:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-07 00:53:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:53:25,378 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:53:25,378 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:53:25,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:53:25,583 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:53:25,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:53:25,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1155466264, now seen corresponding path program 2 times [2019-10-07 00:53:25,583 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:53:25,584 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:53:25,584 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:53:25,584 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:53:25,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:53:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:53:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:53:25,808 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:53:25,808 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:53:25,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:53:25,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 00:53:25,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:53:25,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-07 00:53:25,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:53:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:53:26,072 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:53:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:53:26,236 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:53:26,237 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:53:26,238 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:53:26,238 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:53:26,239 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:53:26,239 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:53:26,289 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-07 00:53:26,714 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2019-10-07 00:53:26,727 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:53:26,734 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:53:26,735 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:53:26,735 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 90#(and (exists ((v_main_~a~0.base_BEFORE_CALL_2 Int) (v_main_~a~0.offset_BEFORE_CALL_2 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2)) (<= 100000 ~MAX~0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:53:26,735 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 99#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-07 00:53:26,736 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 38#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (<= ~SIZE~0 2147483647) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 100000 ~MAX~0)) [2019-10-07 00:53:26,736 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 85#(and (exists ((v_main_~a~0.base_BEFORE_CALL_2 Int) (v_main_~a~0.offset_BEFORE_CALL_2 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2)) (<= 100000 ~MAX~0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:53:26,736 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-07 00:53:26,737 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 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) (<= 100000 ~MAX~0)) [2019-10-07 00:53:26,737 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 70#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0)) [2019-10-07 00:53:26,737 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 104#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-07 00:53:26,737 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:53:26,738 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 95#(and (exists ((v_main_~a~0.base_BEFORE_CALL_2 Int) (v_main_~a~0.offset_BEFORE_CALL_2 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2)) (<= 100000 ~MAX~0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:53:26,738 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 65#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (= 0 |#NULL.base|) (<= 7 main_~val1~0) (<= main_~i~0 99998) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (= main_~a~0.offset |main_#t~malloc2.offset|) (<= ~SIZE~0 2147483647) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (store |old(#length)| |main_#t~malloc2.base| (* 4 ~SIZE~0)) |#length|) (<= 3 main_~val2~0) (<= 0 (+ main_~i~0 1)) (<= ~SIZE~0 100000) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= main_~i~0 (+ ~SIZE~0 (- 2))) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= main_~low~0 2) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 7 main_~val1~0) (<= main_~i~0 99998) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3))) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) [2019-10-07 00:53:26,738 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 80#(exists ((v_main_~a~0.base_BEFORE_CALL_2 Int) (v_main_~a~0.offset_BEFORE_CALL_2 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2)) (<= 100000 ~MAX~0)))) [2019-10-07 00:53:26,739 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 75#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (< main_~i~0 ~SIZE~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (= |main_#t~mem5| (select (select |#memory_int| main_~a~0.base) (+ (* 4 main_~i~0) main_~a~0.offset))) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0)) [2019-10-07 00:53:27,343 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 33 [2019-10-07 00:53:27,707 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:53:27,707 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 32 [2019-10-07 00:53:27,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-07 00:53:27,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-07 00:53:27,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2019-10-07 00:53:27,710 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 32 states. [2019-10-07 00:53:28,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:53:28,933 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-10-07 00:53:28,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 00:53:28,934 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 14 [2019-10-07 00:53:28,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:53:28,936 INFO L225 Difference]: With dead ends: 30 [2019-10-07 00:53:28,936 INFO L226 Difference]: Without dead ends: 28 [2019-10-07 00:53:28,937 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=249, Invalid=1557, Unknown=0, NotChecked=0, Total=1806 [2019-10-07 00:53:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-07 00:53:28,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-10-07 00:53:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-07 00:53:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-10-07 00:53:28,945 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2019-10-07 00:53:28,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:53:28,946 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-10-07 00:53:28,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-07 00:53:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-10-07 00:53:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 00:53:28,947 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:53:28,947 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:53:29,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:53:29,150 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:53:29,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:53:29,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1734055745, now seen corresponding path program 1 times [2019-10-07 00:53:29,151 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:53:29,151 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:53:29,151 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:53:29,151 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:53:29,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:53:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:53:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:53:29,324 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:53:29,324 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:53:29,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:53:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:53:29,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-07 00:53:29,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:53:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:53:32,048 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:53:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:53:32,295 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:53:32,297 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-07 00:53:32,297 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:53:32,297 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:53:32,297 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:53:32,298 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:53:32,345 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-07 00:53:32,971 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-07 00:53:33,039 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:53:33,046 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:53:33,046 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:53:33,046 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 188#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-07 00:53:33,047 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 197#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-07 00:53:33,047 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 183#(and (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= 100000 ~MAX~0)) [2019-10-07 00:53:33,047 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 38#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (<= ~SIZE~0 2147483647) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 100000 ~MAX~0)) [2019-10-07 00:53:33,048 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 178#(and (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= 100000 ~MAX~0)) [2019-10-07 00:53:33,048 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 173#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= ~MAX~0 100000) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= ~MAX~0 100000) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-07 00:53:33,048 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-07 00:53:33,049 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 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) (<= 100000 ~MAX~0)) [2019-10-07 00:53:33,049 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 163#(and (or (and (= |old(~SIZE~0)| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (<= 1 main_~i~0) (= |#NULL.base| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (= |#NULL.base| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0))) (or (and (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)))) [2019-10-07 00:53:33,049 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 202#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-07 00:53:33,049 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:53:33,050 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 193#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-07 00:53:33,050 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 65#(and (or (and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= main_~val1~0 7) (= main_~a~0.offset |main_#t~malloc2.offset|) (<= ~SIZE~0 2147483647) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (store |old(#length)| |main_#t~malloc2.base| (* 4 ~SIZE~0)) |#length|) (<= 0 (+ main_~i~0 1)) (not (= |main_#t~malloc2.base| 0)) (<= 0 (+ ~SIZE~0 2147483648)) (= 0 (select |old(#valid)| 0)) (= main_~i~0 (+ ~SIZE~0 (- 2))) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= main_~low~0 2) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (= |#NULL.base| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3))) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~i~0 99998) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) [2019-10-07 00:53:33,050 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 168#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= ~MAX~0 100000) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= ~MAX~0 100000) (= |#NULL.offset| 0))) (or (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-07 00:53:33,051 INFO L193 IcfgInterpreter]: Reachable states at location L32-1 satisfy 154#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 2 |main_#t~mem5|) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 |main_#t~mem5|) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3)) [2019-10-07 00:53:33,051 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 142#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3)) [2019-10-07 00:53:35,739 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 34 [2019-10-07 00:53:36,108 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-10-07 00:53:36,727 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:53:36,727 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10, 12] total 39 [2019-10-07 00:53:36,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-07 00:53:36,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-07 00:53:36,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1320, Unknown=2, NotChecked=0, Total=1482 [2019-10-07 00:53:36,729 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 39 states. [2019-10-07 00:53:43,666 WARN L191 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-10-07 00:53:47,946 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-10-07 00:53:50,183 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-10-07 00:53:53,924 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-10-07 00:53:56,157 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-10-07 00:54:01,536 WARN L191 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2019-10-07 00:54:02,100 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-10-07 00:54:06,443 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-10-07 00:54:10,640 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-10-07 00:54:20,414 WARN L191 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-10-07 00:54:29,248 WARN L191 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-10-07 00:54:35,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:54:35,593 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2019-10-07 00:54:35,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-07 00:54:35,593 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 21 [2019-10-07 00:54:35,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:54:35,596 INFO L225 Difference]: With dead ends: 66 [2019-10-07 00:54:35,596 INFO L226 Difference]: Without dead ends: 64 [2019-10-07 00:54:35,599 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=655, Invalid=4448, Unknown=9, NotChecked=0, Total=5112 [2019-10-07 00:54:35,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-07 00:54:35,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 29. [2019-10-07 00:54:35,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 00:54:35,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-07 00:54:35,611 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2019-10-07 00:54:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:54:35,612 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-07 00:54:35,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-07 00:54:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-07 00:54:35,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 00:54:35,614 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:54:35,614 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:54:35,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:54:35,822 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:54:35,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:54:35,823 INFO L82 PathProgramCache]: Analyzing trace with hash 648727096, now seen corresponding path program 2 times [2019-10-07 00:54:35,823 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:54:35,824 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:54:35,824 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:54:35,824 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:54:35,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:54:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:54:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:54:35,914 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:54:35,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:54:35,915 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:54:35,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:54:35,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:54:35,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-07 00:54:35,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:54:36,045 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:54:36,046 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:54:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:54:36,106 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:54:36,107 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-07 00:54:36,108 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:54:36,108 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:54:36,108 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:54:36,108 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:54:36,139 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-07 00:54:36,622 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-07 00:54:36,662 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:54:36,665 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:54:36,666 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:54:36,666 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 188#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-07 00:54:36,666 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 197#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-07 00:54:36,666 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 183#(and (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= 100000 ~MAX~0)) [2019-10-07 00:54:36,667 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 38#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= ~SIZE~0 2147483647) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 100000 ~MAX~0)) [2019-10-07 00:54:36,667 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 178#(and (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= 100000 ~MAX~0)) [2019-10-07 00:54:36,667 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 173#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= ~MAX~0 100000) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= ~MAX~0 100000) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-07 00:54:36,667 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-07 00:54:36,668 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 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) (<= 100000 ~MAX~0)) [2019-10-07 00:54:36,668 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 163#(and (or (and (= |old(~SIZE~0)| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (<= 1 main_~i~0) (= |#NULL.base| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (= |#NULL.base| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0))) (or (and (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)))) [2019-10-07 00:54:36,668 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 202#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-07 00:54:36,668 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:54:36,669 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 193#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-07 00:54:36,669 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 65#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (= 0 |#NULL.base|) (<= 7 main_~val1~0) (<= main_~i~0 99998) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (= main_~a~0.offset |main_#t~malloc2.offset|) (<= 2 main_~low~0) (<= ~SIZE~0 2147483647) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (store |old(#length)| |main_#t~malloc2.base| (* 4 ~SIZE~0)) |#length|) (<= 3 main_~val2~0) (<= 0 (+ main_~i~0 1)) (<= ~SIZE~0 100000) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (= main_~i~0 (+ ~SIZE~0 (- 2))) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (<= main_~low~0 2) (= |main_#t~malloc2.base| main_~a~0.base) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 7 main_~val1~0) (<= main_~i~0 99998) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3))) (<= 100000 ~MAX~0)) [2019-10-07 00:54:36,669 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 168#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= ~MAX~0 100000) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= ~MAX~0 100000) (= |#NULL.offset| 0))) (or (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-07 00:54:36,669 INFO L193 IcfgInterpreter]: Reachable states at location L32-1 satisfy 154#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 2 |main_#t~mem5|) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 |main_#t~mem5|) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3)) [2019-10-07 00:54:36,670 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 142#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3)) [2019-10-07 00:54:37,198 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 33 [2019-10-07 00:54:37,529 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-10-07 00:54:38,008 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:54:38,008 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 12] total 27 [2019-10-07 00:54:38,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-07 00:54:38,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-07 00:54:38,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-10-07 00:54:38,010 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 27 states. [2019-10-07 00:54:39,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:54:39,733 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-10-07 00:54:39,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-07 00:54:39,733 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2019-10-07 00:54:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:54:39,734 INFO L225 Difference]: With dead ends: 54 [2019-10-07 00:54:39,734 INFO L226 Difference]: Without dead ends: 30 [2019-10-07 00:54:39,736 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=366, Invalid=1796, Unknown=0, NotChecked=0, Total=2162 [2019-10-07 00:54:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-07 00:54:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-07 00:54:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-07 00:54:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-07 00:54:39,745 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2019-10-07 00:54:39,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:54:39,745 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-07 00:54:39,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-07 00:54:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-10-07 00:54:39,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-07 00:54:39,746 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:54:39,747 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:54:39,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:54:39,951 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:54:39,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:54:39,952 INFO L82 PathProgramCache]: Analyzing trace with hash 932701034, now seen corresponding path program 3 times [2019-10-07 00:54:39,952 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:54:39,952 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:54:39,952 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:54:39,953 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:54:39,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:54:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:54:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:54:40,168 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:54:40,168 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:54:40,168 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:54:40,237 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:54:40,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:54:40,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-07 00:54:40,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:54:40,479 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:54:40,586 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-10-07 00:54:50,921 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 51 [2019-10-07 00:54:52,982 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 51 [2019-10-07 00:55:08,491 WARN L191 SmtUtils]: Spent 4.01 s on a formula simplification that was a NOOP. DAG size: 46 [2019-10-07 00:55:10,648 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 51 [2019-10-07 00:55:10,986 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 99 [2019-10-07 00:55:11,208 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 17 [2019-10-07 00:55:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:55:11,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:55:13,782 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 22 [2019-10-07 00:55:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:55:13,865 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:55:13,866 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-07 00:55:13,866 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:55:13,867 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:55:13,867 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:55:13,867 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:55:13,904 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-07 00:55:14,406 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-07 00:55:14,452 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:55:14,456 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:55:14,456 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:55:14,457 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 189#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-07 00:55:14,457 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 198#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-07 00:55:14,457 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 184#(and (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= 100000 ~MAX~0)) [2019-10-07 00:55:14,457 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 38#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (<= ~SIZE~0 2147483647) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 100000 ~MAX~0)) [2019-10-07 00:55:14,458 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 179#(and (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= 100000 ~MAX~0)) [2019-10-07 00:55:14,458 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 174#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= ~MAX~0 100000) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= ~MAX~0 100000) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-07 00:55:14,458 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-07 00:55:14,458 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 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) (<= 100000 ~MAX~0)) [2019-10-07 00:55:14,459 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 164#(and (or (and (= |old(~SIZE~0)| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (<= 1 main_~i~0) (= |#NULL.base| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (= |#NULL.base| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0))) (or (and (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)))) [2019-10-07 00:55:14,459 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 203#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-07 00:55:14,459 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:55:14,459 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 194#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-07 00:55:14,459 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 65#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (= 0 |#NULL.base|) (<= 7 main_~val1~0) (<= main_~i~0 99998) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (= main_~a~0.offset |main_#t~malloc2.offset|) (<= ~SIZE~0 2147483647) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (store |old(#length)| |main_#t~malloc2.base| (* 4 ~SIZE~0)) |#length|) (<= 3 main_~val2~0) (<= 0 (+ main_~i~0 1)) (<= ~SIZE~0 100000) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= main_~i~0 (+ ~SIZE~0 (- 2))) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= main_~low~0 2) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 7 main_~val1~0) (<= main_~i~0 99998) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3))) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) [2019-10-07 00:55:14,460 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= ~MAX~0 100000) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= ~MAX~0 100000) (= |#NULL.offset| 0))) (or (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-07 00:55:14,460 INFO L193 IcfgInterpreter]: Reachable states at location L32-1 satisfy 155#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 2 |main_#t~mem5|) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 |main_#t~mem5|) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3)) [2019-10-07 00:55:14,460 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 143#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3)) [2019-10-07 00:55:19,202 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 33 [2019-10-07 00:55:19,564 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-10-07 00:55:20,295 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:55:20,295 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 12, 12] total 47 [2019-10-07 00:55:20,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-07 00:55:20,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-07 00:55:20,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1938, Unknown=12, NotChecked=0, Total=2162 [2019-10-07 00:55:20,298 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 47 states. [2019-10-07 00:55:33,612 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-07 00:55:39,818 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-10-07 00:55:50,632 WARN L191 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-10-07 00:55:54,936 WARN L191 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-10-07 00:55:59,273 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-10-07 00:55:59,556 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2019-10-07 00:56:01,711 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 86 DAG size of output: 54 [2019-10-07 00:56:06,015 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2019-10-07 00:56:08,520 WARN L191 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-10-07 00:56:12,840 WARN L191 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2019-10-07 00:56:15,048 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-10-07 00:56:23,219 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-07 00:56:37,490 WARN L191 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-10-07 00:56:43,732 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 77 [2019-10-07 00:56:56,024 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-10-07 00:57:14,400 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-10-07 00:57:18,642 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-10-07 00:57:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:22,945 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-10-07 00:57:22,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-07 00:57:22,946 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 29 [2019-10-07 00:57:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:22,948 INFO L225 Difference]: With dead ends: 41 [2019-10-07 00:57:22,948 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 00:57:22,949 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 113.1s TimeCoverageRelationStatistics Valid=571, Invalid=4089, Unknown=32, NotChecked=0, Total=4692 [2019-10-07 00:57:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 00:57:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-10-07 00:57:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 00:57:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-10-07 00:57:22,960 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2019-10-07 00:57:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:22,960 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-10-07 00:57:22,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-07 00:57:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-10-07 00:57:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 00:57:22,961 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:22,961 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:23,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:57:23,163 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:23,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:23,163 INFO L82 PathProgramCache]: Analyzing trace with hash 321063213, now seen corresponding path program 4 times [2019-10-07 00:57:23,164 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:23,164 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:23,164 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:23,164 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:23,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:57:23,254 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:23,255 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:57:23,255 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:57:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:23,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 00:57:23,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:57:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:57:23,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:57:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:57:23,503 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:57:23,505 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-07 00:57:23,505 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:57:23,505 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:57:23,506 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:57:23,506 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:57:23,529 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-07 00:57:24,287 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-07 00:57:24,365 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-07 00:57:24,370 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:57:24,371 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:57:24,371 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 188#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-07 00:57:24,372 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 197#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-07 00:57:24,372 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 183#(and (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= 100000 ~MAX~0)) [2019-10-07 00:57:24,372 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 38#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (<= ~SIZE~0 2147483647) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 100000 ~MAX~0)) [2019-10-07 00:57:24,373 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 178#(and (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= 100000 ~MAX~0)) [2019-10-07 00:57:24,373 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 173#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= ~MAX~0 100000) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= ~MAX~0 100000) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-07 00:57:24,373 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-07 00:57:24,373 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 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) (<= 100000 ~MAX~0)) [2019-10-07 00:57:24,374 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 163#(and (or (and (= |old(~SIZE~0)| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (<= 1 main_~i~0) (= |#NULL.base| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (= |#NULL.base| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0))) (or (and (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)))) [2019-10-07 00:57:24,374 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 202#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-07 00:57:24,374 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:57:24,374 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 193#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-07 00:57:24,375 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 65#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (= 0 |#NULL.base|) (<= 7 main_~val1~0) (<= main_~i~0 99998) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (= main_~a~0.offset |main_#t~malloc2.offset|) (<= ~SIZE~0 2147483647) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (store |old(#length)| |main_#t~malloc2.base| (* 4 ~SIZE~0)) |#length|) (<= 3 main_~val2~0) (<= 0 (+ main_~i~0 1)) (<= ~SIZE~0 100000) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= main_~i~0 (+ ~SIZE~0 (- 2))) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= main_~low~0 2) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 7 main_~val1~0) (<= main_~i~0 99998) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3))) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) [2019-10-07 00:57:24,375 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 168#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= ~MAX~0 100000) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= ~MAX~0 100000) (= |#NULL.offset| 0))) (or (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-07 00:57:24,375 INFO L193 IcfgInterpreter]: Reachable states at location L32-1 satisfy 154#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 2 |main_#t~mem5|) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 |main_#t~mem5|) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3)) [2019-10-07 00:57:24,375 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 142#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3)) [2019-10-07 00:57:25,195 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 33 [2019-10-07 00:57:25,554 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-10-07 00:57:26,106 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:57:26,107 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10, 12] total 30 [2019-10-07 00:57:26,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-07 00:57:26,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-07 00:57:26,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2019-10-07 00:57:26,109 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 30 states. [2019-10-07 00:57:28,409 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-10-07 00:57:28,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:28,542 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2019-10-07 00:57:28,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-07 00:57:28,543 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-10-07 00:57:28,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:28,544 INFO L225 Difference]: With dead ends: 61 [2019-10-07 00:57:28,545 INFO L226 Difference]: Without dead ends: 34 [2019-10-07 00:57:28,547 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 81 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=539, Invalid=2541, Unknown=0, NotChecked=0, Total=3080 [2019-10-07 00:57:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-07 00:57:28,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-07 00:57:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-07 00:57:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-10-07 00:57:28,559 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 36 [2019-10-07 00:57:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:28,559 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-10-07 00:57:28,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-07 00:57:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-10-07 00:57:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-07 00:57:28,560 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:28,560 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:28,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:57:28,772 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:28,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:28,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1958424481, now seen corresponding path program 5 times [2019-10-07 00:57:28,772 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:28,773 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:28,773 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:28,773 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:28,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:57:29,023 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:29,023 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:57:29,024 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:57:29,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-07 00:57:29,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:57:29,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-07 00:57:29,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:57:29,605 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-07 00:57:29,790 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:57:29,982 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-10-07 00:57:32,292 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 58 [2019-10-07 00:57:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 00:57:33,421 INFO L322 TraceCheckSpWp]: Computing backward predicates...