java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-crafted/zero_sum_const_m2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:06:02,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:06:02,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:06:02,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:06:02,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:06:02,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:06:02,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:06:02,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:06:02,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:06:02,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:06:02,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:06:02,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:06:02,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:06:02,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:06:02,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:06:02,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:06:02,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:06:02,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:06:02,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:06:02,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:06:02,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:06:02,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:06:02,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:06:02,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:06:02,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:06:02,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:06:02,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:06:02,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:06:02,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:06:02,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:06:02,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:06:02,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:06:02,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:06:02,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:06:02,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:06:02,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:06:02,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:06:02,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:06:02,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:06:02,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:06:02,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:06:02,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-06 23:06:02,895 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:06:02,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:06:02,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:06:02,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:06:02,898 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:06:02,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:06:02,899 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:06:02,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:06:02,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:06:02,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:06:02,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:06:02,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:06:02,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:06:02,900 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:06:02,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:06:02,900 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:06:02,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:06:02,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:06:02,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:06:02,901 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:06:02,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:06:02,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:06:02,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:06:02,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:06:02,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:06:02,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:06:02,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:06:02,903 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:06:02,903 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-06 23:06:03,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:06:03,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:06:03,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:06:03,184 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:06:03,184 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:06:03,185 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_const_m2.c [2019-10-06 23:06:03,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/512ae688f/acc79e559eb944bb85be70a7629197fc/FLAGe8d9e69e6 [2019-10-06 23:06:03,733 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:06:03,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_const_m2.c [2019-10-06 23:06:03,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/512ae688f/acc79e559eb944bb85be70a7629197fc/FLAGe8d9e69e6 [2019-10-06 23:06:04,165 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/512ae688f/acc79e559eb944bb85be70a7629197fc [2019-10-06 23:06:04,175 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:06:04,178 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:06:04,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:06:04,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:06:04,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:06:04,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:06:04" (1/1) ... [2019-10-06 23:06:04,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d728e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:06:04, skipping insertion in model container [2019-10-06 23:06:04,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:06:04" (1/1) ... [2019-10-06 23:06:04,194 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:06:04,213 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:06:04,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:06:04,416 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:06:04,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:06:04,469 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:06:04,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:06:04 WrapperNode [2019-10-06 23:06:04,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:06:04,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:06:04,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:06:04,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:06:04,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:06:04" (1/1) ... [2019-10-06 23:06:04,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:06:04" (1/1) ... [2019-10-06 23:06:04,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:06:04" (1/1) ... [2019-10-06 23:06:04,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:06:04" (1/1) ... [2019-10-06 23:06:04,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:06:04" (1/1) ... [2019-10-06 23:06:04,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:06:04" (1/1) ... [2019-10-06 23:06:04,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:06:04" (1/1) ... [2019-10-06 23:06:04,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:06:04,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:06:04,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:06:04,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:06:04,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:06:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:06:04,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:06:04,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:06:04,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:06:04,635 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:06:04,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:06:04,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-06 23:06:04,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:06:04,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-06 23:06:04,636 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-06 23:06:04,636 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:06:04,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-06 23:06:04,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:06:04,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:06:04,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:06:04,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:06:04,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:06:05,038 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:06:05,038 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-06 23:06:05,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:06:05 BoogieIcfgContainer [2019-10-06 23:06:05,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:06:05,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:06:05,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:06:05,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:06:05,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:06:04" (1/3) ... [2019-10-06 23:06:05,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3649be2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:06:05, skipping insertion in model container [2019-10-06 23:06:05,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:06:04" (2/3) ... [2019-10-06 23:06:05,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3649be2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:06:05, skipping insertion in model container [2019-10-06 23:06:05,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:06:05" (3/3) ... [2019-10-06 23:06:05,047 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum_const_m2.c [2019-10-06 23:06:05,056 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:06:05,063 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:06:05,074 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:06:05,098 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:06:05,098 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:06:05,099 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:06:05,099 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:06:05,099 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:06:05,099 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:06:05,099 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:06:05,099 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:06:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-06 23:06:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-06 23:06:05,119 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:06:05,119 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:06:05,121 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:06:05,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:06:05,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1821330543, now seen corresponding path program 1 times [2019-10-06 23:06:05,134 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:06:05,134 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:05,135 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:05,135 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:06:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:06:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:06:05,343 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:05,343 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:06:05,344 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-06 23:06:05,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-06 23:06:05,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-06 23:06:05,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-06 23:06:05,362 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2019-10-06 23:06:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:06:05,463 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-10-06 23:06:05,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-06 23:06:05,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-06 23:06:05,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:06:05,481 INFO L225 Difference]: With dead ends: 41 [2019-10-06 23:06:05,482 INFO L226 Difference]: Without dead ends: 20 [2019-10-06 23:06:05,490 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-06 23:06:05,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-06 23:06:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-06 23:06:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-06 23:06:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-10-06 23:06:05,542 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 15 [2019-10-06 23:06:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:06:05,543 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-10-06 23:06:05,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-06 23:06:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2019-10-06 23:06:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-06 23:06:05,545 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:06:05,546 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:06:05,546 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:06:05,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:06:05,548 INFO L82 PathProgramCache]: Analyzing trace with hash 780224693, now seen corresponding path program 1 times [2019-10-06 23:06:05,548 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:06:05,548 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:05,548 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:05,549 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:05,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:06:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:06:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:06:05,640 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:05,641 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:06:05,641 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:06:05,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:06:05,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:06:05,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:06:05,644 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2019-10-06 23:06:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:06:05,680 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2019-10-06 23:06:05,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:06:05,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-06 23:06:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:06:05,682 INFO L225 Difference]: With dead ends: 34 [2019-10-06 23:06:05,683 INFO L226 Difference]: Without dead ends: 21 [2019-10-06 23:06:05,684 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:06:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-06 23:06:05,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-06 23:06:05,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:06:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-10-06 23:06:05,690 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 16 [2019-10-06 23:06:05,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:06:05,691 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-10-06 23:06:05,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:06:05,691 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2019-10-06 23:06:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-06 23:06:05,692 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:06:05,692 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:06:05,693 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:06:05,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:06:05,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2044161761, now seen corresponding path program 1 times [2019-10-06 23:06:05,694 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:06:05,694 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:05,694 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:05,694 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:05,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:06:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:06:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:06:05,768 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:05,769 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:06:05,769 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-06 23:06:05,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-06 23:06:05,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-06 23:06:05,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:06:05,770 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 4 states. [2019-10-06 23:06:05,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:06:05,847 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2019-10-06 23:06:05,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:06:05,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-06 23:06:05,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:06:05,849 INFO L225 Difference]: With dead ends: 32 [2019-10-06 23:06:05,849 INFO L226 Difference]: Without dead ends: 21 [2019-10-06 23:06:05,850 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:06:05,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-06 23:06:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-06 23:06:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:06:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-06 23:06:05,867 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 17 [2019-10-06 23:06:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:06:05,867 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-06 23:06:05,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-06 23:06:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-06 23:06:05,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-06 23:06:05,869 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:06:05,869 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:06:05,869 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:06:05,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:06:05,870 INFO L82 PathProgramCache]: Analyzing trace with hash -791089743, now seen corresponding path program 1 times [2019-10-06 23:06:05,870 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:06:05,870 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:05,870 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:05,870 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:05,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:06:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:06:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:06:05,950 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:05,950 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:06:05,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:06:06,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:06:06,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:06:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:06:06,086 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:06:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:06:06,142 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:06:06,191 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:06:06,194 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:06:06,201 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:06:06,208 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:06:06,209 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:06:06,428 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:06:07,661 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:06:07,726 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:06:07,737 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:06:07,737 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:06:07,737 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:07,738 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:07,738 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:06:07,739 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:06:07,739 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:07,740 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:07,740 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:07,741 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-06 23:06:07,741 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-06 23:06:07,741 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:07,741 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:06:07,742 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:06:07,742 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:07,743 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:06:07,743 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:07,744 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:08,257 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:06:08,586 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2019-10-06 23:06:08,731 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-06 23:06:08,734 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:06:08,734 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-06 23:06:08,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:06:08,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:06:08,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:06:08,738 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 18 states. [2019-10-06 23:06:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:06:09,391 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2019-10-06 23:06:09,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-06 23:06:09,392 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2019-10-06 23:06:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:06:09,393 INFO L225 Difference]: With dead ends: 35 [2019-10-06 23:06:09,393 INFO L226 Difference]: Without dead ends: 22 [2019-10-06 23:06:09,396 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2019-10-06 23:06:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-06 23:06:09,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-06 23:06:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-06 23:06:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-06 23:06:09,421 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 20 [2019-10-06 23:06:09,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:06:09,421 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-06 23:06:09,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:06:09,422 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-06 23:06:09,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:06:09,423 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:06:09,423 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:06:09,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:09,628 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:06:09,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:06:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1692918307, now seen corresponding path program 2 times [2019-10-06 23:06:09,629 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:06:09,629 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:09,629 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:09,630 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:09,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:06:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:06:09,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:06:09,714 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:09,714 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:06:09,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:09,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:06:09,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:06:09,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:06:09,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:06:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:06:09,832 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:06:09,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:06:09,852 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:06:09,854 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:06:09,854 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:06:09,855 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:06:09,856 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:06:09,857 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:06:09,911 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:06:10,674 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:06:10,717 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:06:10,723 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:06:10,724 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:06:10,724 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:10,724 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:10,725 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:06:10,725 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:06:10,725 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:10,727 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:10,727 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:10,727 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-06 23:06:10,728 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-06 23:06:10,728 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:10,732 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:06:10,732 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:06:10,732 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:10,732 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:06:10,733 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:10,733 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:11,214 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:06:11,586 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:06:11,587 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-06 23:06:11,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-06 23:06:11,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-06 23:06:11,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-10-06 23:06:11,588 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 19 states. [2019-10-06 23:06:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:06:12,480 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-10-06 23:06:12,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-06 23:06:12,481 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2019-10-06 23:06:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:06:12,482 INFO L225 Difference]: With dead ends: 37 [2019-10-06 23:06:12,482 INFO L226 Difference]: Without dead ends: 26 [2019-10-06 23:06:12,483 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2019-10-06 23:06:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-06 23:06:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-06 23:06:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-06 23:06:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-06 23:06:12,489 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 21 [2019-10-06 23:06:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:06:12,490 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-06 23:06:12,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-06 23:06:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-06 23:06:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-06 23:06:12,491 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:06:12,491 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:06:12,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:12,692 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:06:12,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:06:12,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1878882833, now seen corresponding path program 3 times [2019-10-06 23:06:12,693 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:06:12,694 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:12,694 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:12,694 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:12,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:06:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:06:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:06:13,551 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:13,552 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:06:13,552 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:13,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:06:13,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:06:13,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-06 23:06:13,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:06:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:06:14,138 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:06:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:06:14,643 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:06:14,644 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:06:14,644 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:06:14,645 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:06:14,645 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:06:14,645 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:06:14,682 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:06:15,275 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:06:15,306 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:06:15,311 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:06:15,311 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:06:15,311 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:15,311 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:15,312 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:06:15,312 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:06:15,312 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:15,312 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:15,313 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:15,313 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-06 23:06:15,313 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-06 23:06:15,313 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:15,314 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:06:15,314 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:06:15,314 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:15,314 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:06:15,315 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:15,315 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:16,038 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:06:16,555 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:06:16,556 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 15, 11] total 54 [2019-10-06 23:06:16,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-06 23:06:16,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-06 23:06:16,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2678, Unknown=0, NotChecked=0, Total=2862 [2019-10-06 23:06:16,560 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 54 states. [2019-10-06 23:06:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:06:19,495 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-10-06 23:06:19,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-06 23:06:19,495 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 25 [2019-10-06 23:06:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:06:19,497 INFO L225 Difference]: With dead ends: 41 [2019-10-06 23:06:19,497 INFO L226 Difference]: Without dead ends: 36 [2019-10-06 23:06:19,501 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=368, Invalid=5332, Unknown=0, NotChecked=0, Total=5700 [2019-10-06 23:06:19,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-06 23:06:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-10-06 23:06:19,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-06 23:06:19,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-10-06 23:06:19,508 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 25 [2019-10-06 23:06:19,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:06:19,509 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-10-06 23:06:19,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-06 23:06:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-10-06 23:06:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-06 23:06:19,510 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:06:19,510 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:06:19,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:19,718 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:06:19,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:06:19,718 INFO L82 PathProgramCache]: Analyzing trace with hash -220862923, now seen corresponding path program 4 times [2019-10-06 23:06:19,719 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:06:19,719 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:19,719 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:19,719 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:19,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:06:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:06:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:06:19,771 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:19,771 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:06:19,772 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:06:19,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:06:19,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:06:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:06:19,897 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:06:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:06:19,933 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:06:19,935 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:06:19,935 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:06:19,936 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:06:19,936 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:06:19,936 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:06:19,962 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-06 23:06:20,420 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:06:20,442 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:06:20,445 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:06:20,445 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:06:20,445 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:20,445 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:20,446 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:06:20,446 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:06:20,446 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:20,446 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:20,447 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:20,447 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-06 23:06:20,447 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-06 23:06:20,447 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:20,447 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:06:20,448 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:06:20,448 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:20,448 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:06:20,448 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:20,448 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:20,907 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:06:21,296 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:06:21,297 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 24 [2019-10-06 23:06:21,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-06 23:06:21,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-06 23:06:21,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2019-10-06 23:06:21,299 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 24 states. [2019-10-06 23:06:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:06:22,367 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2019-10-06 23:06:22,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-06 23:06:22,368 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-10-06 23:06:22,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:06:22,373 INFO L225 Difference]: With dead ends: 66 [2019-10-06 23:06:22,373 INFO L226 Difference]: Without dead ends: 39 [2019-10-06 23:06:22,374 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=219, Invalid=1263, Unknown=0, NotChecked=0, Total=1482 [2019-10-06 23:06:22,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-06 23:06:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-10-06 23:06:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-06 23:06:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-10-06 23:06:22,382 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 26 [2019-10-06 23:06:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:06:22,383 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-10-06 23:06:22,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-06 23:06:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2019-10-06 23:06:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-06 23:06:22,384 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:06:22,384 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:06:22,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:22,588 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:06:22,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:06:22,588 INFO L82 PathProgramCache]: Analyzing trace with hash 344147297, now seen corresponding path program 5 times [2019-10-06 23:06:22,589 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:06:22,589 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:22,589 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:22,589 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:22,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:06:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:06:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-06 23:06:22,683 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:22,684 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:06:22,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:22,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:06:22,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:06:22,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:06:22,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:06:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-06 23:06:22,822 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:06:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-06 23:06:22,869 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:06:22,871 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:06:22,871 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:06:22,871 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:06:22,872 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:06:22,872 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:06:22,899 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:06:23,398 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:06:23,423 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:06:23,427 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:06:23,427 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:06:23,427 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:23,427 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:23,427 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:06:23,428 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:06:23,428 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:23,428 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:23,428 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:23,428 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-06 23:06:23,428 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-06 23:06:23,429 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:23,429 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:06:23,429 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:06:23,430 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:23,430 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:06:23,431 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:23,431 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:24,217 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-06 23:06:24,218 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:06:24,218 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 25 [2019-10-06 23:06:24,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-06 23:06:24,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-06 23:06:24,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-10-06 23:06:24,221 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 25 states. [2019-10-06 23:06:25,412 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-10-06 23:06:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:06:25,491 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-10-06 23:06:25,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-06 23:06:25,491 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 27 [2019-10-06 23:06:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:06:25,493 INFO L225 Difference]: With dead ends: 42 [2019-10-06 23:06:25,493 INFO L226 Difference]: Without dead ends: 31 [2019-10-06 23:06:25,494 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=213, Invalid=1269, Unknown=0, NotChecked=0, Total=1482 [2019-10-06 23:06:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-06 23:06:25,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-06 23:06:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-06 23:06:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-06 23:06:25,501 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 27 [2019-10-06 23:06:25,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:06:25,501 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-06 23:06:25,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-06 23:06:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-06 23:06:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-06 23:06:25,502 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:06:25,503 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:06:25,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:25,708 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:06:25,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:06:25,709 INFO L82 PathProgramCache]: Analyzing trace with hash 339030193, now seen corresponding path program 6 times [2019-10-06 23:06:25,709 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:06:25,710 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:25,710 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:25,710 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:25,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:06:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:06:26,356 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2019-10-06 23:06:26,594 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2019-10-06 23:06:26,858 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-10-06 23:06:26,985 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-10-06 23:06:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:06:27,800 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:27,800 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:06:27,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:27,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:06:27,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:06:27,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-06 23:06:27,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:06:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:06:28,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:06:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:06:29,447 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:06:29,448 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:06:29,448 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:06:29,449 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:06:29,449 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:06:29,449 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:06:29,473 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-06 23:06:30,033 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:06:30,066 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:06:30,071 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:06:30,071 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:06:30,071 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:30,072 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:30,072 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:06:30,072 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:06:30,072 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:30,072 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:30,073 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:30,073 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-06 23:06:30,073 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-06 23:06:30,074 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:30,075 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:06:30,075 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:06:30,076 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:30,076 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:06:30,076 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:30,076 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:30,910 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:06:31,494 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:06:31,495 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 19, 11] total 69 [2019-10-06 23:06:31,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-06 23:06:31,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-06 23:06:31,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4433, Unknown=0, NotChecked=0, Total=4692 [2019-10-06 23:06:31,499 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 69 states. [2019-10-06 23:06:34,228 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-10-06 23:06:34,690 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-10-06 23:06:36,010 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 58 [2019-10-06 23:06:36,420 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2019-10-06 23:06:37,338 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 58 [2019-10-06 23:06:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:06:38,800 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2019-10-06 23:06:38,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-06 23:06:38,800 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 30 [2019-10-06 23:06:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:06:38,803 INFO L225 Difference]: With dead ends: 81 [2019-10-06 23:06:38,803 INFO L226 Difference]: Without dead ends: 60 [2019-10-06 23:06:38,807 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3482 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=712, Invalid=11278, Unknown=0, NotChecked=0, Total=11990 [2019-10-06 23:06:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-06 23:06:38,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2019-10-06 23:06:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-06 23:06:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-10-06 23:06:38,819 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 30 [2019-10-06 23:06:38,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:06:38,819 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-10-06 23:06:38,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-06 23:06:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-10-06 23:06:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-06 23:06:38,820 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:06:38,820 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:06:39,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:39,025 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:06:39,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:06:39,025 INFO L82 PathProgramCache]: Analyzing trace with hash -344141442, now seen corresponding path program 7 times [2019-10-06 23:06:39,025 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:06:39,026 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:39,026 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:39,026 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:39,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:06:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:06:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-06 23:06:39,088 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:39,089 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:06:39,089 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:06:39,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:06:39,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:06:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-06 23:06:39,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:06:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-06 23:06:39,338 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:06:39,339 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:06:39,340 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:06:39,340 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:06:39,340 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:06:39,340 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:06:39,365 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-06 23:06:39,976 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:06:40,007 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:06:40,011 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:06:40,011 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:06:40,011 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:40,012 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:40,012 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:06:40,012 INFO L193 IcfgInterpreter]: Reachable states at location L14 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 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 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-06 23:06:40,012 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:40,012 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:40,013 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:40,014 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-06 23:06:40,014 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 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:40,014 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:40,015 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:06:40,015 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:06:40,015 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:40,016 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:06:40,016 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:40,016 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:40,491 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:06:40,878 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-06 23:06:40,879 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:06:40,879 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11, 11] total 28 [2019-10-06 23:06:40,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-06 23:06:40,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-06 23:06:40,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:06:40,881 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 28 states. [2019-10-06 23:06:42,180 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-10-06 23:06:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:06:42,420 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2019-10-06 23:06:42,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-06 23:06:42,420 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 31 [2019-10-06 23:06:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:06:42,422 INFO L225 Difference]: With dead ends: 80 [2019-10-06 23:06:42,422 INFO L226 Difference]: Without dead ends: 50 [2019-10-06 23:06:42,424 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=333, Invalid=2019, Unknown=0, NotChecked=0, Total=2352 [2019-10-06 23:06:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-06 23:06:42,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2019-10-06 23:06:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-06 23:06:42,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-10-06 23:06:42,434 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 31 [2019-10-06 23:06:42,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:06:42,434 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-10-06 23:06:42,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-06 23:06:42,435 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-10-06 23:06:42,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-06 23:06:42,436 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:06:42,436 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:06:42,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:42,642 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:06:42,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:06:42,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1522126593, now seen corresponding path program 8 times [2019-10-06 23:06:42,643 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:06:42,643 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:42,643 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:42,643 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:42,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:06:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:06:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:06:42,729 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:42,729 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:06:42,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:42,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:06:42,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:06:42,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:06:42,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:06:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:06:42,923 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:06:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:06:42,976 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:06:42,977 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:06:42,977 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:06:42,978 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:06:42,978 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:06:42,978 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:06:43,002 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-06 23:06:43,418 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:06:43,442 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:06:43,445 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:06:43,446 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:06:43,446 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:43,446 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:43,446 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:06:43,446 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:06:43,447 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:43,447 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:43,447 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:43,447 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-06 23:06:43,447 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-06 23:06:43,447 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:43,448 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:06:43,448 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:06:43,448 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:43,448 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:06:43,448 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:43,449 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:43,898 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:06:44,269 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:06:44,269 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 28 [2019-10-06 23:06:44,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-06 23:06:44,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-06 23:06:44,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:06:44,272 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 28 states. [2019-10-06 23:06:45,725 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-10-06 23:06:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:06:45,809 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-10-06 23:06:45,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-06 23:06:45,809 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2019-10-06 23:06:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:06:45,810 INFO L225 Difference]: With dead ends: 49 [2019-10-06 23:06:45,810 INFO L226 Difference]: Without dead ends: 36 [2019-10-06 23:06:45,812 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=266, Invalid=1626, Unknown=0, NotChecked=0, Total=1892 [2019-10-06 23:06:45,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-06 23:06:45,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-06 23:06:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-06 23:06:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-06 23:06:45,818 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 32 [2019-10-06 23:06:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:06:45,819 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-06 23:06:45,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-06 23:06:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-06 23:06:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-06 23:06:45,820 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:06:45,820 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:06:46,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:46,028 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:06:46,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:06:46,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1011736431, now seen corresponding path program 9 times [2019-10-06 23:06:46,029 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:06:46,029 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:46,029 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:46,029 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:06:46,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:06:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:06:47,270 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-10-06 23:06:47,479 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-10-06 23:06:47,635 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-10-06 23:06:47,789 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-10-06 23:06:47,924 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-10-06 23:06:48,139 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-10-06 23:06:48,315 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-10-06 23:06:48,486 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-10-06 23:06:48,630 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-06 23:06:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:06:49,077 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:06:49,077 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:06:49,077 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:06:49,227 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:06:49,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:06:49,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 81 conjunts are in the unsatisfiable core [2019-10-06 23:06:49,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:06:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:06:50,218 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:06:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:06:51,602 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:06:51,603 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:06:51,603 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:06:51,604 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:06:51,604 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:06:51,604 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:06:51,628 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-06 23:06:52,099 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:06:52,131 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:06:52,134 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:06:52,134 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:06:52,135 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:52,135 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:52,135 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:06:52,135 INFO L193 IcfgInterpreter]: Reachable states at location L14 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 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 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-06 23:06:52,135 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:52,135 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:52,136 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:52,136 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-06 23:06:52,136 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 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:52,136 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:52,136 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:06:52,136 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (= |#NULL.offset| 0))) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:52,137 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:06:52,137 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:06:52,137 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:06:52,137 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:06:53,765 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:06:53,765 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 23, 11] total 82 [2019-10-06 23:06:53,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-06 23:06:53,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-06 23:06:53,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=6323, Unknown=0, NotChecked=0, Total=6642 [2019-10-06 23:06:53,769 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 82 states. [2019-10-06 23:06:55,154 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 [2019-10-06 23:06:55,416 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 47 [2019-10-06 23:06:55,772 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 54 [2019-10-06 23:06:56,103 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 58 [2019-10-06 23:06:56,474 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 59 [2019-10-06 23:06:56,783 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 73 [2019-10-06 23:06:57,022 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-10-06 23:06:57,246 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-10-06 23:06:57,479 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-06 23:06:57,716 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-10-06 23:06:57,991 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2019-10-06 23:06:58,349 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 63 [2019-10-06 23:06:58,663 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 79 [2019-10-06 23:06:59,199 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-10-06 23:06:59,517 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-10-06 23:06:59,887 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 64 [2019-10-06 23:07:00,356 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2019-10-06 23:07:00,742 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 65 [2019-10-06 23:07:01,027 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 43 [2019-10-06 23:07:01,272 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-10-06 23:07:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:07:02,362 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2019-10-06 23:07:02,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-06 23:07:02,362 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 35 [2019-10-06 23:07:02,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:07:02,364 INFO L225 Difference]: With dead ends: 61 [2019-10-06 23:07:02,364 INFO L226 Difference]: Without dead ends: 56 [2019-10-06 23:07:02,368 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3957 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=771, Invalid=12339, Unknown=0, NotChecked=0, Total=13110 [2019-10-06 23:07:02,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-06 23:07:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2019-10-06 23:07:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-06 23:07:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-10-06 23:07:02,389 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 35 [2019-10-06 23:07:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:07:02,389 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-10-06 23:07:02,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-06 23:07:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-10-06 23:07:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-06 23:07:02,390 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:07:02,391 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:07:02,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:07:02,595 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:07:02,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:07:02,596 INFO L82 PathProgramCache]: Analyzing trace with hash -646077515, now seen corresponding path program 10 times [2019-10-06 23:07:02,596 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:07:02,596 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:07:02,596 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:07:02,596 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:07:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:07:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:07:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-06 23:07:02,685 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:07:02,686 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:07:02,686 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:07:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:07:02,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:07:02,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:07:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-06 23:07:02,922 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:07:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-06 23:07:02,965 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:07:02,966 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:07:02,967 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:07:02,967 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:07:02,967 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:07:02,967 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:07:02,996 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:07:03,427 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:07:03,453 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:07:03,457 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:07:03,457 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:07:03,457 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:07:03,457 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:03,457 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:07:03,457 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 38#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= 0 (+ ~SIZE~0 2147483648)) (<= |#NULL.base| 0) (<= 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-06 23:07:03,458 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:03,458 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:07:03,458 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:03,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-06 23:07:03,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-06 23:07:03,458 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:03,458 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:07:03,458 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (= |#NULL.offset| 0)) (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~SIZE~0 100000) (not (= |main_#t~malloc2.base| 0)) (<= 0 (+ ~SIZE~0 2147483648)) (<= |#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) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:03,459 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:07:03,459 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:07:03,459 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:07:03,459 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:04,344 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:07:04,344 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 11] total 30 [2019-10-06 23:07:04,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-06 23:07:04,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-06 23:07:04,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2019-10-06 23:07:04,346 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 30 states. [2019-10-06 23:07:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:07:05,835 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2019-10-06 23:07:05,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-06 23:07:05,836 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-10-06 23:07:05,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:07:05,837 INFO L225 Difference]: With dead ends: 94 [2019-10-06 23:07:05,837 INFO L226 Difference]: Without dead ends: 53 [2019-10-06 23:07:05,839 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 83 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=372, Invalid=2178, Unknown=0, NotChecked=0, Total=2550 [2019-10-06 23:07:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-06 23:07:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-10-06 23:07:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-06 23:07:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-10-06 23:07:05,850 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 36 [2019-10-06 23:07:05,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:07:05,851 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-10-06 23:07:05,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-06 23:07:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-10-06 23:07:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-06 23:07:05,852 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:07:05,852 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:07:06,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:07:06,055 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:07:06,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:07:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash -57738271, now seen corresponding path program 11 times [2019-10-06 23:07:06,056 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:07:06,056 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:07:06,057 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:07:06,057 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:07:06,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:07:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:07:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-06 23:07:06,146 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:07:06,147 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:07:06,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:07:06,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:07:06,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:07:06,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:07:06,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:07:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-06 23:07:06,411 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:07:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-06 23:07:06,476 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:07:06,478 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:07:06,478 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:07:06,478 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:07:06,478 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:07:06,479 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:07:06,497 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:07:07,107 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:07:07,151 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:07:07,154 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:07:07,155 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:07:07,155 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:07:07,155 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:07,155 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:07:07,155 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:07:07,156 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:07,156 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:07:07,156 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:07,156 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-06 23:07:07,156 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-06 23:07:07,156 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:07,157 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:07:07,157 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:07:07,157 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:07:07,157 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:07:07,157 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:07:07,157 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:07,648 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:07:08,025 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:07:08,026 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 31 [2019-10-06 23:07:08,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-06 23:07:08,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-06 23:07:08,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2019-10-06 23:07:08,028 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 31 states. [2019-10-06 23:07:09,609 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-10-06 23:07:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:07:09,691 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-10-06 23:07:09,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-06 23:07:09,692 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-10-06 23:07:09,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:07:09,693 INFO L225 Difference]: With dead ends: 56 [2019-10-06 23:07:09,693 INFO L226 Difference]: Without dead ends: 41 [2019-10-06 23:07:09,694 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 84 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=328, Invalid=2024, Unknown=0, NotChecked=0, Total=2352 [2019-10-06 23:07:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-06 23:07:09,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-06 23:07:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-06 23:07:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-10-06 23:07:09,704 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 37 [2019-10-06 23:07:09,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:07:09,704 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-10-06 23:07:09,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-06 23:07:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-10-06 23:07:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-06 23:07:09,705 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:07:09,706 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:07:09,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:07:09,910 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:07:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:07:09,910 INFO L82 PathProgramCache]: Analyzing trace with hash 339399601, now seen corresponding path program 12 times [2019-10-06 23:07:09,910 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:07:09,911 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:07:09,911 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:07:09,911 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:07:09,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:07:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:07:10,579 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-10-06 23:07:10,781 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-10-06 23:07:10,992 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-10-06 23:07:11,196 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-10-06 23:07:11,366 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-10-06 23:07:11,507 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-10-06 23:07:11,746 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-10-06 23:07:11,956 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-10-06 23:07:12,172 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-10-06 23:07:12,357 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-10-06 23:07:12,517 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-10-06 23:07:12,663 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-10-06 23:07:12,834 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-10-06 23:07:13,010 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-10-06 23:07:13,156 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-10-06 23:07:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 3 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:07:14,070 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:07:14,070 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:07:14,070 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:07:14,257 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:07:14,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:07:14,259 WARN L254 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 99 conjunts are in the unsatisfiable core [2019-10-06 23:07:14,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:07:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:07:15,699 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:07:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-06 23:07:17,666 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:07:17,667 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:07:17,667 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:07:17,667 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:07:17,667 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:07:17,668 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:07:17,690 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:07:18,095 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:07:18,132 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:07:18,137 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:07:18,138 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:07:18,138 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:07:18,138 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:18,138 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:07:18,138 INFO L193 IcfgInterpreter]: Reachable states at location L14 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)|) (= |#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-06 23:07:18,139 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:18,139 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:07:18,139 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:18,140 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-06 23:07:18,140 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-06 23:07:18,140 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:18,141 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:07:18,141 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:07:18,141 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:07:18,142 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:07:18,142 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:07:18,142 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:19,679 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:07:20,389 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-06 23:07:20,390 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:07:20,390 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32, 27, 11] total 97 [2019-10-06 23:07:20,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-10-06 23:07:20,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-10-06 23:07:20,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=8892, Unknown=0, NotChecked=0, Total=9312 [2019-10-06 23:07:20,393 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 97 states. [2019-10-06 23:07:22,135 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-10-06 23:07:22,407 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 50 [2019-10-06 23:07:22,814 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 52 [2019-10-06 23:07:23,112 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2019-10-06 23:07:23,544 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 62 [2019-10-06 23:07:23,919 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 60 [2019-10-06 23:07:24,284 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-10-06 23:07:24,760 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-10-06 23:07:25,059 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-10-06 23:07:25,365 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 66 [2019-10-06 23:07:25,655 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-10-06 23:07:25,926 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2019-10-06 23:07:26,262 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2019-10-06 23:07:26,595 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-10-06 23:07:26,926 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-10-06 23:07:27,292 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 77 [2019-10-06 23:07:27,579 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-10-06 23:07:27,846 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2019-10-06 23:07:28,152 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-10-06 23:07:28,446 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2019-10-06 23:07:29,572 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 57 [2019-10-06 23:07:29,866 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 34 [2019-10-06 23:07:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:07:31,368 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-10-06 23:07:31,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-06 23:07:31,368 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 40 [2019-10-06 23:07:31,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:07:31,369 INFO L225 Difference]: With dead ends: 69 [2019-10-06 23:07:31,370 INFO L226 Difference]: Without dead ends: 64 [2019-10-06 23:07:31,372 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6350 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=1018, Invalid=17614, Unknown=0, NotChecked=0, Total=18632 [2019-10-06 23:07:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-06 23:07:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2019-10-06 23:07:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-06 23:07:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-10-06 23:07:31,387 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 40 [2019-10-06 23:07:31,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:07:31,387 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-10-06 23:07:31,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-10-06 23:07:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-10-06 23:07:31,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-06 23:07:31,388 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:07:31,388 INFO L385 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:07:31,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:07:31,593 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:07:31,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:07:31,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1305092435, now seen corresponding path program 13 times [2019-10-06 23:07:31,594 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:07:31,594 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:07:31,594 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:07:31,595 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:07:31,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:07:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:07:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-06 23:07:31,718 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:07:31,718 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:07:31,718 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:07:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:07:31,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-06 23:07:31,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:07:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-06 23:07:32,044 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:07:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-06 23:07:32,097 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:07:32,098 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:07:32,098 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:07:32,098 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:07:32,099 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:07:32,099 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:07:32,118 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:07:32,505 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:07:32,533 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:07:32,536 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:07:32,536 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:07:32,537 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:07:32,537 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:32,537 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:07:32,537 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:07:32,537 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:32,537 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:07:32,538 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:32,538 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-06 23:07:32,538 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-06 23:07:32,538 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:32,538 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:07:32,539 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:07:32,539 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:07:32,539 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:07:32,539 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:07:32,539 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:33,496 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:07:33,497 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 11] total 33 [2019-10-06 23:07:33,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-06 23:07:33,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-06 23:07:33,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2019-10-06 23:07:33,499 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 33 states. [2019-10-06 23:07:35,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:07:35,219 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2019-10-06 23:07:35,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-06 23:07:35,220 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 41 [2019-10-06 23:07:35,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:07:35,221 INFO L225 Difference]: With dead ends: 108 [2019-10-06 23:07:35,221 INFO L226 Difference]: Without dead ends: 60 [2019-10-06 23:07:35,222 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 95 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=468, Invalid=2724, Unknown=0, NotChecked=0, Total=3192 [2019-10-06 23:07:35,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-06 23:07:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-10-06 23:07:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-06 23:07:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-10-06 23:07:35,235 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 41 [2019-10-06 23:07:35,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:07:35,235 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-10-06 23:07:35,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-06 23:07:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-10-06 23:07:35,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-06 23:07:35,236 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:07:35,236 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:07:35,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:07:35,438 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:07:35,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:07:35,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1196474881, now seen corresponding path program 14 times [2019-10-06 23:07:35,439 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:07:35,439 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:07:35,439 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:07:35,440 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:07:35,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:07:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:07:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-06 23:07:35,550 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:07:35,550 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:07:35,550 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:07:35,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:07:35,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:07:35,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-06 23:07:35,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:07:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-06 23:07:35,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:07:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-06 23:07:35,931 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:07:35,932 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:07:35,933 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:07:35,933 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:07:35,933 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:07:35,933 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:07:35,954 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:07:36,457 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:07:36,486 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:07:36,489 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:07:36,490 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:07:36,490 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:07:36,490 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:36,490 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:07:36,490 INFO L193 IcfgInterpreter]: Reachable states at location L14 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)|) (= |#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-06 23:07:36,490 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:36,490 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:07:36,490 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:36,491 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-06 23:07:36,491 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-06 23:07:36,491 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:36,491 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:07:36,491 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:07:36,491 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:07:36,491 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:07:36,491 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:07:36,491 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:36,993 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:07:37,382 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-06 23:07:37,383 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:07:37,383 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 34 [2019-10-06 23:07:37,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-06 23:07:37,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-06 23:07:37,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2019-10-06 23:07:37,384 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 34 states. [2019-10-06 23:07:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:07:39,336 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2019-10-06 23:07:39,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-06 23:07:39,337 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 42 [2019-10-06 23:07:39,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:07:39,338 INFO L225 Difference]: With dead ends: 63 [2019-10-06 23:07:39,338 INFO L226 Difference]: Without dead ends: 46 [2019-10-06 23:07:39,339 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 96 SyntacticMatches, 12 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=399, Invalid=2463, Unknown=0, NotChecked=0, Total=2862 [2019-10-06 23:07:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-06 23:07:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-06 23:07:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-06 23:07:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-10-06 23:07:39,351 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 42 [2019-10-06 23:07:39,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:07:39,352 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-10-06 23:07:39,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-06 23:07:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-10-06 23:07:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-06 23:07:39,352 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:07:39,353 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:07:39,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:07:39,557 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:07:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:07:39,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1972721903, now seen corresponding path program 15 times [2019-10-06 23:07:39,558 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:07:39,558 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:07:39,558 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:07:39,559 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:07:39,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:07:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:07:40,415 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-10-06 23:07:40,598 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-10-06 23:07:40,780 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-10-06 23:07:41,033 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-10-06 23:07:41,284 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-10-06 23:07:41,564 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-10-06 23:07:41,782 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-10-06 23:07:41,997 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-10-06 23:07:42,329 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-10-06 23:07:42,618 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-10-06 23:07:42,878 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-10-06 23:07:43,105 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-10-06 23:07:43,377 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-10-06 23:07:43,634 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-10-06 23:07:43,873 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-10-06 23:07:44,102 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-10-06 23:07:44,332 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-10-06 23:07:44,550 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-10-06 23:07:44,774 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-10-06 23:07:45,008 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-06 23:07:45,218 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-10-06 23:07:45,372 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-10-06 23:07:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 6 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:07:46,157 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:07:46,157 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:07:46,157 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:07:46,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:07:46,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:07:46,411 WARN L254 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-06 23:07:46,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:07:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:07:48,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:07:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:07:51,475 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:07:51,476 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:07:51,476 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:07:51,477 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:07:51,477 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:07:51,477 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:07:51,495 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-06 23:07:51,842 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:07:51,862 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:07:51,865 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:07:51,865 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:07:51,865 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:07:51,865 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:51,865 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:07:51,866 INFO L193 IcfgInterpreter]: Reachable states at location L14 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 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 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-06 23:07:51,866 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:51,866 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:07:51,866 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:51,866 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-06 23:07:51,866 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 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:51,866 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:51,866 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:07:51,866 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:07:51,867 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:07:51,867 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:07:51,867 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:07:51,867 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:07:53,131 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:07:53,953 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:07:53,953 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 37, 31, 11] total 111 [2019-10-06 23:07:53,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-06 23:07:53,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-06 23:07:53,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=11702, Unknown=0, NotChecked=0, Total=12210 [2019-10-06 23:07:53,955 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 111 states. [2019-10-06 23:07:56,129 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-10-06 23:07:56,556 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-06 23:07:56,917 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2019-10-06 23:07:57,460 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2019-10-06 23:07:57,919 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2019-10-06 23:07:58,343 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 67 [2019-10-06 23:07:58,944 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 70 [2019-10-06 23:07:59,386 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 75 [2019-10-06 23:07:59,780 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2019-10-06 23:08:00,193 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-10-06 23:08:00,523 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-10-06 23:08:00,821 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-10-06 23:08:01,510 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 76 [2019-10-06 23:08:02,126 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-10-06 23:08:02,544 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 77 [2019-10-06 23:08:02,869 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-10-06 23:08:03,276 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 83 [2019-10-06 23:08:03,587 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-10-06 23:08:04,063 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 83 [2019-10-06 23:08:04,487 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-10-06 23:08:04,915 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 83 [2019-10-06 23:08:05,262 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-10-06 23:08:05,666 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 80 [2019-10-06 23:08:05,954 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-10-06 23:08:06,342 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 55 [2019-10-06 23:08:06,635 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-10-06 23:08:06,908 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-06 23:08:07,626 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2019-10-06 23:08:08,011 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-10-06 23:08:08,441 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 62 [2019-10-06 23:08:08,832 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 85 [2019-10-06 23:08:09,175 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2019-10-06 23:08:09,473 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 40 [2019-10-06 23:08:09,878 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 81 [2019-10-06 23:08:10,245 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 68 [2019-10-06 23:08:10,551 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 41 [2019-10-06 23:08:11,019 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 74 [2019-10-06 23:08:11,389 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 56 [2019-10-06 23:08:11,686 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2019-10-06 23:08:12,217 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 77 [2019-10-06 23:08:12,555 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 52 [2019-10-06 23:08:12,928 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 40 [2019-10-06 23:08:14,251 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2019-10-06 23:08:14,940 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2019-10-06 23:08:15,839 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 85 [2019-10-06 23:08:16,553 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 59 [2019-10-06 23:08:17,185 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 47 [2019-10-06 23:08:17,505 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 26 [2019-10-06 23:08:17,822 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-06 23:08:18,360 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-06 23:08:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:08:19,658 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2019-10-06 23:08:19,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-06 23:08:19,659 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 45 [2019-10-06 23:08:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:08:19,660 INFO L225 Difference]: With dead ends: 117 [2019-10-06 23:08:19,660 INFO L226 Difference]: Without dead ends: 102 [2019-10-06 23:08:19,662 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9982 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=2286, Invalid=31020, Unknown=0, NotChecked=0, Total=33306 [2019-10-06 23:08:19,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-06 23:08:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 64. [2019-10-06 23:08:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-06 23:08:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2019-10-06 23:08:19,683 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 45 [2019-10-06 23:08:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:08:19,683 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2019-10-06 23:08:19,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-06 23:08:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2019-10-06 23:08:19,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-06 23:08:19,684 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:08:19,684 INFO L385 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:08:19,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:08:19,889 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:08:19,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:08:19,889 INFO L82 PathProgramCache]: Analyzing trace with hash -985366219, now seen corresponding path program 16 times [2019-10-06 23:08:19,890 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:08:19,890 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:08:19,890 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:08:19,890 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:08:19,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:08:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:08:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-06 23:08:20,029 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:08:20,030 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:08:20,030 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:08:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:08:20,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-06 23:08:20,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:08:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-06 23:08:20,364 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:08:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-06 23:08:20,438 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:08:20,438 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:08:20,439 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:08:20,439 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:08:20,440 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:08:20,440 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:08:20,459 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:08:20,833 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:08:20,852 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:08:20,858 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:08:20,859 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:08:20,859 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:08:20,859 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:08:20,859 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:08:20,859 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:08:20,859 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:08:20,859 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:08:20,860 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:08:20,860 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-06 23:08:20,860 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-06 23:08:20,860 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:08:20,860 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:08:20,860 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:08:20,860 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:08:20,860 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:08:20,861 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:08:20,861 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:08:21,383 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:08:21,805 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-06 23:08:21,806 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:08:21,806 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16, 11] total 36 [2019-10-06 23:08:21,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-06 23:08:21,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-06 23:08:21,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2019-10-06 23:08:21,807 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 36 states. [2019-10-06 23:08:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:08:23,815 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2019-10-06 23:08:23,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-06 23:08:23,816 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 46 [2019-10-06 23:08:23,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:08:23,817 INFO L225 Difference]: With dead ends: 124 [2019-10-06 23:08:23,817 INFO L226 Difference]: Without dead ends: 67 [2019-10-06 23:08:23,818 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 107 SyntacticMatches, 12 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=577, Invalid=3329, Unknown=0, NotChecked=0, Total=3906 [2019-10-06 23:08:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-06 23:08:23,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2019-10-06 23:08:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-06 23:08:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-10-06 23:08:23,835 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 46 [2019-10-06 23:08:23,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:08:23,836 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-10-06 23:08:23,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-06 23:08:23,836 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-10-06 23:08:23,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-06 23:08:23,836 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:08:23,837 INFO L385 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:08:24,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:08:24,038 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:08:24,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:08:24,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1003917921, now seen corresponding path program 17 times [2019-10-06 23:08:24,038 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:08:24,038 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:08:24,039 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:08:24,039 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:08:24,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:08:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:08:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:08:24,214 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:08:24,215 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:08:24,215 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:08:24,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:08:24,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:08:24,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-06 23:08:24,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:08:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:08:24,617 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:08:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-06 23:08:24,734 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:08:24,735 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:08:24,735 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:08:24,735 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:08:24,736 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:08:24,736 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:08:24,760 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-06 23:08:25,134 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:08:25,155 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:08:25,158 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:08:25,158 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:08:25,158 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:08:25,158 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:08:25,158 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:08:25,158 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:08:25,158 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:08:25,159 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:08:25,159 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:08:25,159 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-06 23:08:25,159 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:08:25,159 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-06 23:08:25,159 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:08:25,159 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:08:25,159 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:08:25,160 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:08:25,160 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:08:25,160 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:08:25,665 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:08:26,060 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:08:26,060 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17, 11] total 37 [2019-10-06 23:08:26,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-06 23:08:26,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-06 23:08:26,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2019-10-06 23:08:26,062 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 37 states. [2019-10-06 23:08:28,091 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-10-06 23:08:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:08:28,168 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-10-06 23:08:28,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-06 23:08:28,169 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 47 [2019-10-06 23:08:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:08:28,170 INFO L225 Difference]: With dead ends: 70 [2019-10-06 23:08:28,170 INFO L226 Difference]: Without dead ends: 51 [2019-10-06 23:08:28,170 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 108 SyntacticMatches, 14 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=479, Invalid=2943, Unknown=0, NotChecked=0, Total=3422 [2019-10-06 23:08:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-06 23:08:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-10-06 23:08:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-06 23:08:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-06 23:08:28,187 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 47 [2019-10-06 23:08:28,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:08:28,187 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-06 23:08:28,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-06 23:08:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-06 23:08:28,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-06 23:08:28,188 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:08:28,188 INFO L385 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:08:28,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:08:28,393 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:08:28,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:08:28,393 INFO L82 PathProgramCache]: Analyzing trace with hash -747776335, now seen corresponding path program 18 times [2019-10-06 23:08:28,393 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:08:28,394 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:08:28,394 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:08:28,394 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:08:28,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:08:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:08:29,090 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-10-06 23:08:29,354 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-10-06 23:08:29,563 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-10-06 23:08:29,777 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-10-06 23:08:29,992 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-10-06 23:08:30,274 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-10-06 23:08:30,555 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-10-06 23:08:30,825 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-10-06 23:08:31,082 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-10-06 23:08:31,292 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-10-06 23:08:31,543 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-10-06 23:08:31,772 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-10-06 23:08:32,014 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-10-06 23:08:32,325 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-10-06 23:08:32,647 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-10-06 23:08:32,947 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-10-06 23:08:33,243 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-06 23:08:33,481 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-10-06 23:08:33,699 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-10-06 23:08:33,939 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2019-10-06 23:08:34,157 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-10-06 23:08:34,378 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-10-06 23:08:34,606 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-10-06 23:08:34,846 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-10-06 23:08:35,068 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-10-06 23:08:35,226 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-10-06 23:08:35,389 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-10-06 23:08:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 6 proven. 134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:08:36,177 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:08:36,178 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:08:36,178 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:08:36,460 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:08:36,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:08:36,462 WARN L254 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 135 conjunts are in the unsatisfiable core [2019-10-06 23:08:36,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:08:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:08:39,102 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:08:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-06 23:08:43,128 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:08:43,129 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:08:43,129 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:08:43,129 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:08:43,129 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:08:43,129 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:08:43,151 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-06 23:08:43,503 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:08:43,526 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:08:43,528 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:08:43,528 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:08:43,528 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:08:43,529 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:08:43,529 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:08:43,529 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:08:43,529 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:08:43,529 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:08:43,529 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:08:43,530 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-06 23:08:43,530 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:08:43,530 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-06 23:08:43,530 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:08:43,530 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:08:43,530 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:08:43,530 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:08:43,531 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:08:43,531 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:08:44,891 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:08:45,751 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:08:45,752 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 42, 35, 11] total 125 [2019-10-06 23:08:45,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-10-06 23:08:45,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-10-06 23:08:45,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=14823, Unknown=0, NotChecked=0, Total=15500 [2019-10-06 23:08:45,754 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 125 states. [2019-10-06 23:08:46,415 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 29 [2019-10-06 23:08:47,879 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-10-06 23:08:48,227 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-10-06 23:08:48,673 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-10-06 23:08:49,016 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 62 [2019-10-06 23:08:49,560 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 65 [2019-10-06 23:08:50,015 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2019-10-06 23:08:50,531 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 71 [2019-10-06 23:08:50,997 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 78 [2019-10-06 23:08:51,610 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 79 [2019-10-06 23:08:52,098 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 77 [2019-10-06 23:08:52,611 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2019-10-06 23:08:53,257 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-10-06 23:08:53,588 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-10-06 23:08:53,923 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2019-10-06 23:08:54,290 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-10-06 23:08:54,653 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 85 [2019-10-06 23:08:55,048 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-10-06 23:08:55,451 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 90 [2019-10-06 23:08:55,989 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 88 [2019-10-06 23:08:56,502 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112 [2019-10-06 23:08:56,931 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-10-06 23:08:57,341 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 89 [2019-10-06 23:08:57,762 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 93 [2019-10-06 23:08:58,237 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 99 [2019-10-06 23:08:58,655 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 98 [2019-10-06 23:08:59,198 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 101 [2019-10-06 23:08:59,749 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 82 [2019-10-06 23:09:00,383 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 82 [2019-10-06 23:09:00,786 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 81 [2019-10-06 23:09:01,136 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 65 [2019-10-06 23:09:01,511 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 66 [2019-10-06 23:09:01,903 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 67 [2019-10-06 23:09:02,304 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 62 [2019-10-06 23:09:02,643 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-10-06 23:09:02,972 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-10-06 23:09:03,491 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-10-06 23:09:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:09:04,245 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2019-10-06 23:09:04,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-06 23:09:04,245 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 50 [2019-10-06 23:09:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:09:04,246 INFO L225 Difference]: With dead ends: 85 [2019-10-06 23:09:04,247 INFO L226 Difference]: Without dead ends: 80 [2019-10-06 23:09:04,248 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10514 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=1561, Invalid=28195, Unknown=0, NotChecked=0, Total=29756 [2019-10-06 23:09:04,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-06 23:09:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2019-10-06 23:09:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-06 23:09:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2019-10-06 23:09:04,268 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 50 [2019-10-06 23:09:04,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:09:04,268 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2019-10-06 23:09:04,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-10-06 23:09:04,269 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2019-10-06 23:09:04,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-06 23:09:04,269 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:09:04,269 INFO L385 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:09:04,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:09:04,470 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:09:04,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:09:04,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1688778067, now seen corresponding path program 19 times [2019-10-06 23:09:04,471 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:09:04,471 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:09:04,471 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:09:04,471 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:09:04,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:09:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:09:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-06 23:09:04,627 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:09:04,627 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:09:04,627 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:09:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:09:04,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-06 23:09:04,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:09:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-06 23:09:05,056 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:09:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-06 23:09:05,147 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:09:05,148 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:09:05,148 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:09:05,148 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:09:05,148 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:09:05,148 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:09:05,169 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-06 23:09:05,702 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:09:05,723 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:09:05,725 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:09:05,726 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:09:05,726 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:09:05,726 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:09:05,726 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:09:05,726 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:09:05,726 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:09:05,726 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:09:05,726 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:09:05,726 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-06 23:09:05,727 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:09:05,727 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-06 23:09:05,727 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:09:05,727 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:09:05,727 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:09:05,727 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:09:05,728 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:09:05,728 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:09:06,286 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:09:06,719 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:09:06,720 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18, 11] total 39 [2019-10-06 23:09:06,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-06 23:09:06,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-06 23:09:06,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1251, Unknown=0, NotChecked=0, Total=1482 [2019-10-06 23:09:06,721 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 39 states. [2019-10-06 23:09:08,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:09:08,942 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2019-10-06 23:09:08,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-06 23:09:08,944 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 51 [2019-10-06 23:09:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:09:08,945 INFO L225 Difference]: With dead ends: 136 [2019-10-06 23:09:08,945 INFO L226 Difference]: Without dead ends: 74 [2019-10-06 23:09:08,946 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 119 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=699, Invalid=3993, Unknown=0, NotChecked=0, Total=4692 [2019-10-06 23:09:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-06 23:09:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-10-06 23:09:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-06 23:09:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-10-06 23:09:08,967 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 51 [2019-10-06 23:09:08,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:09:08,967 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-10-06 23:09:08,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-06 23:09:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-10-06 23:09:08,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-06 23:09:08,968 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:09:08,968 INFO L385 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:09:09,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:09:09,169 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:09:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:09:09,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1115876095, now seen corresponding path program 20 times [2019-10-06 23:09:09,170 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:09:09,170 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:09:09,170 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:09:09,170 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:09:09,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:09:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:09:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-06 23:09:09,399 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:09:09,399 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:09:09,400 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:09:09,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:09:09,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:09:09,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-06 23:09:09,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:09:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-06 23:09:09,910 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:09:10,029 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-06 23:09:10,029 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:09:10,031 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:09:10,031 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:09:10,031 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:09:10,031 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:09:10,031 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:09:10,054 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:09:10,426 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:09:10,448 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:09:10,451 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:09:10,451 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:09:10,451 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:09:10,451 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:09:10,451 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:09:10,451 INFO L193 IcfgInterpreter]: Reachable states at location L14 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)|) (= |#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-06 23:09:10,452 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:09:10,452 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:09:10,452 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:09:10,452 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-06 23:09:10,452 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:09:10,452 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-06 23:09:10,452 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:09:10,452 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:09:10,453 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:09:10,453 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:09:10,453 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:09:10,453 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:09:10,963 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:09:11,359 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:09:11,360 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19, 11] total 40 [2019-10-06 23:09:11,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-06 23:09:11,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-06 23:09:11,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1322, Unknown=0, NotChecked=0, Total=1560 [2019-10-06 23:09:11,361 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 40 states. [2019-10-06 23:09:13,801 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-10-06 23:09:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:09:13,893 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-10-06 23:09:13,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-06 23:09:13,894 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2019-10-06 23:09:13,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:09:13,895 INFO L225 Difference]: With dead ends: 77 [2019-10-06 23:09:13,895 INFO L226 Difference]: Without dead ends: 56 [2019-10-06 23:09:13,896 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 16 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=568, Invalid=3464, Unknown=0, NotChecked=0, Total=4032 [2019-10-06 23:09:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-06 23:09:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-10-06 23:09:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-06 23:09:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-10-06 23:09:13,912 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 52 [2019-10-06 23:09:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:09:13,913 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-10-06 23:09:13,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-06 23:09:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-10-06 23:09:13,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-06 23:09:13,913 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:09:13,913 INFO L385 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:09:14,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:09:14,118 INFO L410 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:09:14,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:09:14,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1610412655, now seen corresponding path program 21 times [2019-10-06 23:09:14,119 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:09:14,119 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:09:14,119 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:09:14,120 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:09:14,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:09:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:09:14,752 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 41 [2019-10-06 23:09:14,915 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-10-06 23:09:15,121 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 48 [2019-10-06 23:09:15,312 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-10-06 23:09:15,488 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-10-06 23:09:15,682 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2019-10-06 23:09:15,892 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-10-06 23:09:16,129 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2019-10-06 23:09:16,350 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-10-06 23:09:16,589 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-10-06 23:09:16,799 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-10-06 23:09:16,992 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-10-06 23:09:17,211 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-10-06 23:09:17,470 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-10-06 23:09:17,647 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-10-06 23:09:17,957 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-10-06 23:09:18,343 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2019-10-06 23:09:18,685 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 60 [2019-10-06 23:09:18,981 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 60 [2019-10-06 23:09:19,263 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 59 [2019-10-06 23:09:19,558 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 61 [2019-10-06 23:09:19,849 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-10-06 23:09:20,215 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2019-10-06 23:09:20,466 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2019-10-06 23:09:20,730 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 59 [2019-10-06 23:09:21,095 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 62 [2019-10-06 23:09:21,375 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 60 [2019-10-06 23:09:21,662 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 60 [2019-10-06 23:09:21,948 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 61 [2019-10-06 23:09:22,244 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 66 [2019-10-06 23:09:22,533 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-10-06 23:09:22,797 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-10-06 23:09:22,979 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2019-10-06 23:09:23,208 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 56 [2019-10-06 23:09:23,434 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-10-06 23:09:23,623 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-10-06 23:09:23,809 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-10-06 23:09:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 21 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:09:24,501 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:09:24,501 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:09:24,501 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:09:24,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:09:24,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:09:24,821 WARN L254 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 153 conjunts are in the unsatisfiable core [2019-10-06 23:09:24,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:09:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:09:28,949 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:09:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-06 23:09:35,318 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:09:35,319 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:09:35,319 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:09:35,319 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:09:35,320 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:09:35,320 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:09:35,339 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:09:35,776 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:09:35,816 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:09:35,821 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:09:35,822 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:09:35,823 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:09:35,824 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:09:35,824 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:09:35,824 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:09:35,825 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:09:35,836 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:09:35,837 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:09:35,837 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-06 23:09:35,837 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:09:35,837 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-06 23:09:35,838 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:09:35,838 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:09:35,839 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:09:35,839 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:09:35,839 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:09:35,839 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:09:37,534 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:09:38,574 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:09:38,574 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 47, 39, 11] total 139 [2019-10-06 23:09:38,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-10-06 23:09:38,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-10-06 23:09:38,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=18463, Unknown=0, NotChecked=0, Total=19182 [2019-10-06 23:09:38,576 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 139 states. [2019-10-06 23:09:40,762 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-10-06 23:09:41,182 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-10-06 23:09:41,613 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-10-06 23:09:42,057 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-10-06 23:09:42,596 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-10-06 23:09:42,921 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-10-06 23:09:43,510 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 68 [2019-10-06 23:09:43,929 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2019-10-06 23:09:44,389 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 72 [2019-10-06 23:09:44,882 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 82 [2019-10-06 23:09:45,374 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 78 [2019-10-06 23:09:45,872 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 82 [2019-10-06 23:09:46,474 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 83 [2019-10-06 23:09:47,044 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 111 [2019-10-06 23:09:47,503 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 61 [2019-10-06 23:09:47,852 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-10-06 23:09:48,638 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 85 [2019-10-06 23:09:49,445 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 85 [2019-10-06 23:09:49,769 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 64 [2019-10-06 23:09:50,235 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 88 [2019-10-06 23:09:50,584 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-10-06 23:09:51,047 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 88 [2019-10-06 23:09:51,384 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 51 [2019-10-06 23:09:51,870 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 89 [2019-10-06 23:09:52,654 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 90 [2019-10-06 23:09:53,536 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 93 [2019-10-06 23:09:54,101 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 118 [2019-10-06 23:09:54,614 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-10-06 23:09:55,302 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 92 [2019-10-06 23:09:55,870 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 97 [2019-10-06 23:09:56,437 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 92 [2019-10-06 23:09:56,767 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 60 [2019-10-06 23:09:57,253 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 91 [2019-10-06 23:09:57,804 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 98 [2019-10-06 23:09:58,151 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2019-10-06 23:09:58,798 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 99 [2019-10-06 23:09:59,385 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 85 [2019-10-06 23:09:59,733 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 47 [2019-10-06 23:10:00,784 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 83 [2019-10-06 23:10:01,477 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 78 [2019-10-06 23:10:01,944 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 74 [2019-10-06 23:10:02,506 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 79 [2019-10-06 23:10:03,033 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 62 [2019-10-06 23:10:03,570 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 53 [2019-10-06 23:10:04,071 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 40 [2019-10-06 23:10:04,504 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-10-06 23:10:04,915 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-10-06 23:10:05,324 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-10-06 23:10:05,736 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 27 [2019-10-06 23:10:06,283 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-10-06 23:10:06,651 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 25 [2019-10-06 23:10:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:10:07,634 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2019-10-06 23:10:07,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-06 23:10:07,634 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 55 [2019-10-06 23:10:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:10:07,635 INFO L225 Difference]: With dead ends: 97 [2019-10-06 23:10:07,635 INFO L226 Difference]: Without dead ends: 91 [2019-10-06 23:10:07,637 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11687 ImplicationChecksByTransitivity, 44.8s TimeCoverageRelationStatistics Valid=2357, Invalid=39463, Unknown=0, NotChecked=0, Total=41820 [2019-10-06 23:10:07,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-06 23:10:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 57. [2019-10-06 23:10:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-06 23:10:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-10-06 23:10:07,658 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 55 [2019-10-06 23:10:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:10:07,658 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-10-06 23:10:07,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-10-06 23:10:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-10-06 23:10:07,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-06 23:10:07,658 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:10:07,658 INFO L385 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:10:07,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:10:07,859 INFO L410 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:10:07,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:10:07,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1258933108, now seen corresponding path program 22 times [2019-10-06 23:10:07,860 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:10:07,860 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:10:07,861 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:10:07,861 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:10:07,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:10:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:10:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-06 23:10:08,078 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:10:08,078 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:10:08,078 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:10:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:10:08,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-06 23:10:08,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:10:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-06 23:10:08,584 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:10:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-06 23:10:08,717 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:10:08,718 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:10:08,718 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:10:08,718 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:10:08,718 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:10:08,718 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:10:08,738 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:10:09,101 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:10:09,120 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:10:09,123 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:10:09,123 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:10:09,123 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:10:09,123 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:10:09,124 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:10:09,124 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:10:09,124 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:10:09,124 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:10:09,124 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:10:09,124 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-06 23:10:09,124 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:10:09,125 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-06 23:10:09,125 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:10:09,125 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:10:09,125 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:10:09,125 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:10:09,126 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:10:09,126 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:10:09,690 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:10:10,126 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-06 23:10:10,127 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:10:10,127 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21, 11] total 43 [2019-10-06 23:10:10,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-06 23:10:10,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-06 23:10:10,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1518, Unknown=0, NotChecked=0, Total=1806 [2019-10-06 23:10:10,128 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 43 states. [2019-10-06 23:10:12,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:10:12,576 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2019-10-06 23:10:12,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-06 23:10:12,576 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 56 [2019-10-06 23:10:12,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:10:12,578 INFO L225 Difference]: With dead ends: 131 [2019-10-06 23:10:12,578 INFO L226 Difference]: Without dead ends: 61 [2019-10-06 23:10:12,579 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 130 SyntacticMatches, 17 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2083 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=842, Invalid=4708, Unknown=0, NotChecked=0, Total=5550 [2019-10-06 23:10:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-06 23:10:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-06 23:10:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-06 23:10:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-10-06 23:10:12,599 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 56 [2019-10-06 23:10:12,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:10:12,599 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-10-06 23:10:12,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-06 23:10:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-10-06 23:10:12,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-06 23:10:12,600 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:10:12,600 INFO L385 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:10:12,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:10:12,801 INFO L410 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:10:12,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:10:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1683110321, now seen corresponding path program 23 times [2019-10-06 23:10:12,802 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:10:12,802 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:10:12,802 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:10:12,803 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:10:12,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:10:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:10:13,334 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-10-06 23:10:13,459 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2019-10-06 23:10:13,636 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-10-06 23:10:13,822 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2019-10-06 23:10:13,994 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 [2019-10-06 23:10:14,158 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-10-06 23:10:14,323 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-10-06 23:10:14,506 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2019-10-06 23:10:14,799 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-10-06 23:10:15,105 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-10-06 23:10:15,517 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2019-10-06 23:10:15,836 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-10-06 23:10:16,268 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-10-06 23:10:16,585 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-10-06 23:10:16,985 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-10-06 23:10:17,367 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2019-10-06 23:10:17,761 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-10-06 23:10:18,084 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-10-06 23:10:18,465 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 71 [2019-10-06 23:10:18,866 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 72 [2019-10-06 23:10:19,260 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 72 [2019-10-06 23:10:19,688 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2019-10-06 23:10:20,109 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-10-06 23:10:20,452 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2019-10-06 23:10:20,761 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2019-10-06 23:10:21,164 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2019-10-06 23:10:21,452 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-10-06 23:10:21,709 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2019-10-06 23:10:22,049 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-10-06 23:10:22,368 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2019-10-06 23:10:22,686 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2019-10-06 23:10:23,010 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2019-10-06 23:10:23,303 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-10-06 23:10:23,595 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-10-06 23:10:23,867 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-10-06 23:10:24,125 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-10-06 23:10:24,366 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-10-06 23:10:24,557 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-10-06 23:10:24,760 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-10-06 23:10:24,949 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-10-06 23:10:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 21 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:10:26,052 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:10:26,052 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:10:26,052 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:10:26,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-06 23:10:26,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:10:26,443 WARN L254 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 173 conjunts are in the unsatisfiable core [2019-10-06 23:10:26,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:10:35,507 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-10-06 23:10:35,885 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 30 [2019-10-06 23:10:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 27 proven. 183 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-06 23:10:36,405 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:10:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-06 23:10:57,599 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:10:57,600 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:10:57,600 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:10:57,600 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:10:57,601 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:10:57,601 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:10:57,620 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:10:58,070 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:10:58,109 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:10:58,114 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:10:58,114 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:10:58,115 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:10:58,115 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:10:58,115 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:10:58,116 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:10:58,116 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:10:58,116 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:10:58,116 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:10:58,117 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-06 23:10:58,117 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:10:58,117 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-06 23:10:58,118 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:10:58,118 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:10:58,118 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:10:58,119 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:10:58,119 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:10:58,119 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:11:00,430 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:11:01,865 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:11:01,865 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 49, 44, 11] total 150 [2019-10-06 23:11:01,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-10-06 23:11:01,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-10-06 23:11:01,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=21305, Unknown=0, NotChecked=0, Total=22350 [2019-10-06 23:11:01,868 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 150 states. [2019-10-06 23:11:03,948 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 27 [2019-10-06 23:11:05,219 WARN L191 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 128 [2019-10-06 23:11:07,057 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-10-06 23:11:07,864 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-06 23:11:08,707 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-10-06 23:11:09,492 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-10-06 23:11:10,376 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-10-06 23:11:11,348 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 104 [2019-10-06 23:11:12,060 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 72 [2019-10-06 23:11:13,368 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 77 [2019-10-06 23:11:14,084 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 79 [2019-10-06 23:11:14,810 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 84 [2019-10-06 23:11:15,605 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 83 [2019-10-06 23:11:16,497 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 109 [2019-10-06 23:11:17,364 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 111 [2019-10-06 23:11:19,284 WARN L191 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 114 [2019-10-06 23:11:20,737 WARN L191 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 112 [2019-10-06 23:11:21,648 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 121 [2019-10-06 23:11:22,996 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 100 [2019-10-06 23:11:24,515 WARN L191 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 171 [2019-10-06 23:11:25,264 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 111 [2019-10-06 23:11:26,174 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 121 [2019-10-06 23:11:26,984 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 113 [2019-10-06 23:11:27,876 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 130 [2019-10-06 23:11:29,400 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 140 [2019-10-06 23:11:30,885 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 117 [2019-10-06 23:11:32,566 WARN L191 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 277 DAG size of output: 136 [2019-10-06 23:11:34,171 WARN L191 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 121 [2019-10-06 23:11:35,210 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 147 [2019-10-06 23:11:36,617 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 120 [2019-10-06 23:11:37,656 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 132 [2019-10-06 23:11:38,607 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 122 [2019-10-06 23:11:39,521 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 119 [2019-10-06 23:11:40,443 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 117 [2019-10-06 23:11:41,920 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 119 [2019-10-06 23:11:43,455 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 274 DAG size of output: 122 [2019-10-06 23:11:45,339 WARN L191 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 123 [2019-10-06 23:11:46,897 WARN L191 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 274 DAG size of output: 123 [2019-10-06 23:11:47,884 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 123 [2019-10-06 23:11:48,766 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2019-10-06 23:11:49,730 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 84 [2019-10-06 23:11:50,507 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 79 [2019-10-06 23:11:51,229 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 76 [2019-10-06 23:11:51,917 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 78 [2019-10-06 23:11:52,687 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 68 [2019-10-06 23:11:53,489 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 74 [2019-10-06 23:11:54,370 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 76 [2019-10-06 23:11:55,826 WARN L191 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 77 [2019-10-06 23:11:56,441 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-10-06 23:11:56,981 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-10-06 23:11:57,545 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-10-06 23:11:58,317 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-10-06 23:11:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:11:59,726 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2019-10-06 23:11:59,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-06 23:11:59,727 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 60 [2019-10-06 23:11:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:11:59,728 INFO L225 Difference]: With dead ends: 101 [2019-10-06 23:11:59,729 INFO L226 Difference]: Without dead ends: 96 [2019-10-06 23:11:59,731 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14644 ImplicationChecksByTransitivity, 89.3s TimeCoverageRelationStatistics Valid=2919, Invalid=41813, Unknown=0, NotChecked=0, Total=44732 [2019-10-06 23:11:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-06 23:11:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2019-10-06 23:11:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-06 23:11:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2019-10-06 23:11:59,766 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 60 [2019-10-06 23:11:59,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:11:59,766 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2019-10-06 23:11:59,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-10-06 23:11:59,766 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2019-10-06 23:11:59,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-06 23:11:59,767 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:11:59,767 INFO L385 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:11:59,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:11:59,972 INFO L410 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:11:59,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:11:59,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1715022163, now seen corresponding path program 24 times [2019-10-06 23:11:59,973 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:11:59,973 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:11:59,973 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:11:59,974 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:11:59,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:11:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:12:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-06 23:12:00,416 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:12:00,417 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:12:00,417 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:12:00,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:12:00,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:12:00,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-06 23:12:00,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:12:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-06 23:12:01,006 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:12:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-06 23:12:01,150 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:12:01,150 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:12:01,150 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:12:01,151 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:12:01,151 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:12:01,151 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:12:01,172 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:12:01,705 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:12:01,744 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:12:01,749 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:12:01,749 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:12:01,750 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:12:01,750 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:12:01,750 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:12:01,750 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:12:01,751 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:12:01,751 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:12:01,751 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:12:01,752 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-06 23:12:01,752 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:12:01,752 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-06 23:12:01,752 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:12:01,753 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:12:01,753 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:12:01,753 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:12:01,753 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:12:01,754 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:12:02,424 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:12:02,879 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-06 23:12:02,880 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:12:02,880 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22, 11] total 45 [2019-10-06 23:12:02,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-06 23:12:02,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-06 23:12:02,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=1661, Unknown=0, NotChecked=0, Total=1980 [2019-10-06 23:12:02,882 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 45 states. [2019-10-06 23:12:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:12:05,731 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2019-10-06 23:12:05,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-06 23:12:05,732 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 61 [2019-10-06 23:12:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:12:05,733 INFO L225 Difference]: With dead ends: 164 [2019-10-06 23:12:05,733 INFO L226 Difference]: Without dead ends: 88 [2019-10-06 23:12:05,734 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 143 SyntacticMatches, 18 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2304 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=982, Invalid=5498, Unknown=0, NotChecked=0, Total=6480 [2019-10-06 23:12:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-06 23:12:05,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2019-10-06 23:12:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-06 23:12:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2019-10-06 23:12:05,771 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 61 [2019-10-06 23:12:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:12:05,771 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2019-10-06 23:12:05,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-06 23:12:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2019-10-06 23:12:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-06 23:12:05,771 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:12:05,771 INFO L385 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:12:05,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:12:05,973 INFO L410 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:12:05,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:12:05,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1640155137, now seen corresponding path program 25 times [2019-10-06 23:12:05,973 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:12:05,974 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:12:05,974 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:12:05,974 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:12:05,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:12:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:12:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-06 23:12:06,192 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:12:06,192 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:12:06,192 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:12:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:12:06,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-06 23:12:06,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:12:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-06 23:12:06,797 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:12:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-06 23:12:06,966 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:12:06,967 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:12:06,967 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:12:06,968 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:12:06,968 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:12:06,968 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:12:06,987 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-06 23:12:07,473 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:12:07,502 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:12:07,524 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:12:07,524 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:12:07,524 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:12:07,524 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:12:07,524 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:12:07,525 INFO L193 IcfgInterpreter]: Reachable states at location L14 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 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 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-06 23:12:07,525 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:12:07,525 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:12:07,525 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:12:07,525 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-06 23:12:07,526 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:12:07,526 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 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0) (<= 100000 ~MAX~0)) [2019-10-06 23:12:07,526 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:12:07,526 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= main_~sum~0 0) (= 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|) (<= ~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) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~sum~0 0) (= |#NULL.offset| 0))) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:12:07,527 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:12:07,527 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:12:07,527 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:12:07,527 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:12:08,259 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 27 [2019-10-06 23:12:08,923 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-06 23:12:08,924 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:12:08,924 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23, 11] total 46 [2019-10-06 23:12:08,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-06 23:12:08,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-06 23:12:08,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1744, Unknown=0, NotChecked=0, Total=2070 [2019-10-06 23:12:08,925 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 46 states. [2019-10-06 23:12:12,075 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-10-06 23:12:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:12:12,176 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2019-10-06 23:12:12,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-06 23:12:12,177 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 62 [2019-10-06 23:12:12,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:12:12,178 INFO L225 Difference]: With dead ends: 91 [2019-10-06 23:12:12,178 INFO L226 Difference]: Without dead ends: 66 [2019-10-06 23:12:12,179 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 144 SyntacticMatches, 20 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2086 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=773, Invalid=4629, Unknown=0, NotChecked=0, Total=5402 [2019-10-06 23:12:12,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-06 23:12:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-06 23:12:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-06 23:12:12,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-06 23:12:12,218 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 62 [2019-10-06 23:12:12,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:12:12,218 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-06 23:12:12,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-06 23:12:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-06 23:12:12,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-06 23:12:12,219 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:12:12,219 INFO L385 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:12:12,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:12:12,420 INFO L410 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:12:12,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:12:12,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2141760495, now seen corresponding path program 26 times [2019-10-06 23:12:12,421 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:12:12,421 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:12:12,421 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:12:12,422 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:12:12,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:12:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:12:13,355 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2019-10-06 23:12:13,493 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 40 [2019-10-06 23:12:13,672 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 [2019-10-06 23:12:13,884 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 48 [2019-10-06 23:12:14,085 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-10-06 23:12:14,277 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-10-06 23:12:14,487 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2019-10-06 23:12:14,772 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-10-06 23:12:15,061 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 70 [2019-10-06 23:12:15,367 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2019-10-06 23:12:15,752 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-10-06 23:12:16,062 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 69 [2019-10-06 23:12:16,388 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2019-10-06 23:12:16,720 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2019-10-06 23:12:17,067 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2019-10-06 23:12:17,393 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-10-06 23:12:17,730 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-10-06 23:12:18,024 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-10-06 23:12:18,422 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 73 [2019-10-06 23:12:18,835 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 75 [2019-10-06 23:12:19,249 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 80 [2019-10-06 23:12:19,702 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 82 [2019-10-06 23:12:20,130 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 76 [2019-10-06 23:12:20,553 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 79 [2019-10-06 23:12:20,976 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 78 [2019-10-06 23:12:21,424 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-10-06 23:12:21,856 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 79 [2019-10-06 23:12:22,249 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-10-06 23:12:22,533 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-10-06 23:12:22,905 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 73 [2019-10-06 23:12:23,313 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2019-10-06 23:12:23,709 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2019-10-06 23:12:24,108 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 72 [2019-10-06 23:12:24,492 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 71 [2019-10-06 23:12:24,888 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2019-10-06 23:12:25,265 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2019-10-06 23:12:25,611 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 64 [2019-10-06 23:12:25,929 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-10-06 23:12:26,194 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-10-06 23:12:26,416 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-10-06 23:12:26,635 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-10-06 23:12:26,835 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-10-06 23:12:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 28 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:12:28,165 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:12:28,165 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:12:28,166 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:12:28,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-06 23:12:28,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:12:28,631 WARN L254 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 196 conjunts are in the unsatisfiable core [2019-10-06 23:12:28,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:12:38,184 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 29 [2019-10-06 23:12:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 6 proven. 254 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-06 23:12:38,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:13:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-06 23:13:07,028 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:13:07,029 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:13:07,029 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:13:07,030 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:13:07,030 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:13:07,030 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:13:07,057 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:13:07,404 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:13:07,427 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:13:07,430 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:13:07,430 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:13:07,430 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:13:07,430 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:13:07,431 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:13:07,431 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:13:07,431 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:13:07,431 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:13:07,431 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:13:07,431 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-06 23:13:07,431 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:13:07,431 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-06 23:13:07,431 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:13:07,431 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:13:07,432 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:13:07,432 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:13:07,432 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:13:07,432 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:13:09,848 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:13:11,359 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:13:11,360 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 54, 48, 11] total 163 [2019-10-06 23:13:11,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-10-06 23:13:11,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-10-06 23:13:11,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1283, Invalid=25123, Unknown=0, NotChecked=0, Total=26406 [2019-10-06 23:13:11,362 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 163 states. [2019-10-06 23:13:13,534 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 30 [2019-10-06 23:13:14,432 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 94 [2019-10-06 23:13:16,354 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-10-06 23:13:17,092 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-06 23:13:17,860 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-10-06 23:13:18,702 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-10-06 23:13:19,522 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-10-06 23:13:20,399 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-10-06 23:13:21,439 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 111 [2019-10-06 23:13:21,976 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-10-06 23:13:23,372 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 83 [2019-10-06 23:13:24,051 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 88 [2019-10-06 23:13:24,794 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 88 [2019-10-06 23:13:25,534 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 91 [2019-10-06 23:13:26,294 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 91 [2019-10-06 23:13:27,177 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 118 [2019-10-06 23:13:28,114 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 121 [2019-10-06 23:13:30,229 WARN L191 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 122 [2019-10-06 23:13:32,163 WARN L191 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 190 [2019-10-06 23:13:33,223 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 134 [2019-10-06 23:13:34,662 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 109 [2019-10-06 23:13:35,524 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 91 [2019-10-06 23:13:36,341 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 112 [2019-10-06 23:13:37,180 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 115 [2019-10-06 23:13:38,024 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 117 [2019-10-06 23:13:38,897 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 117 [2019-10-06 23:13:39,775 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 127 [2019-10-06 23:13:42,828 WARN L191 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 265 DAG size of output: 237 [2019-10-06 23:13:46,632 WARN L191 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 300 DAG size of output: 231 [2019-10-06 23:13:49,518 WARN L191 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 262 DAG size of output: 241 [2019-10-06 23:13:51,531 WARN L191 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 210 [2019-10-06 23:13:52,717 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 151 [2019-10-06 23:13:53,921 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 129 [2019-10-06 23:13:54,858 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 132 [2019-10-06 23:13:55,857 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 138 [2019-10-06 23:13:56,787 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 131 [2019-10-06 23:13:57,791 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 133 [2019-10-06 23:13:58,803 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 133 [2019-10-06 23:14:02,097 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 285 DAG size of output: 238 [2019-10-06 23:14:04,262 WARN L191 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 183 [2019-10-06 23:14:06,461 WARN L191 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 183 [2019-10-06 23:14:08,697 WARN L191 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 202 [2019-10-06 23:14:09,872 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 135 [2019-10-06 23:14:10,851 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 85 [2019-10-06 23:14:12,000 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 86 [2019-10-06 23:14:12,813 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 81 [2019-10-06 23:14:13,602 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 78 [2019-10-06 23:14:14,396 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 80 [2019-10-06 23:14:15,188 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 72 [2019-10-06 23:14:16,078 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 90 [2019-10-06 23:14:17,020 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 93 [2019-10-06 23:14:17,975 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 93 [2019-10-06 23:14:19,224 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 87 [2019-10-06 23:14:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:14:22,889 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2019-10-06 23:14:22,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-06 23:14:22,890 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 65 [2019-10-06 23:14:22,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:14:22,891 INFO L225 Difference]: With dead ends: 109 [2019-10-06 23:14:22,891 INFO L226 Difference]: Without dead ends: 104 [2019-10-06 23:14:22,893 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 87 SyntacticMatches, 6 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16174 ImplicationChecksByTransitivity, 108.6s TimeCoverageRelationStatistics Valid=3372, Invalid=48384, Unknown=0, NotChecked=0, Total=51756 [2019-10-06 23:14:22,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-06 23:14:22,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 90. [2019-10-06 23:14:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-06 23:14:22,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2019-10-06 23:14:22,940 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 65 [2019-10-06 23:14:22,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:14:22,940 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2019-10-06 23:14:22,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-10-06 23:14:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2019-10-06 23:14:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-06 23:14:22,940 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:14:22,941 INFO L385 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:14:23,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:14:23,141 INFO L410 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:14:23,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:14:23,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1151361995, now seen corresponding path program 27 times [2019-10-06 23:14:23,142 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:14:23,142 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:14:23,143 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:14:23,143 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:14:23,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:14:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:14:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-10-06 23:14:23,430 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:14:23,430 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:14:23,431 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:14:23,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:14:23,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:14:23,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-06 23:14:23,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:14:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-10-06 23:14:24,159 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:14:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-10-06 23:14:24,320 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:14:24,321 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:14:24,321 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:14:24,322 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:14:24,322 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:14:24,322 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:14:24,345 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-06 23:14:24,751 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:14:24,773 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:14:24,775 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:14:24,775 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:14:24,776 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:14:24,776 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:14:24,776 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:14:24,776 INFO L193 IcfgInterpreter]: Reachable states at location L14 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-06 23:14:24,776 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:14:24,776 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:14:24,776 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:14:24,776 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-06 23:14:24,776 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:14:24,777 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-06 23:14:24,777 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:14:24,777 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:14:24,777 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:14:24,777 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:14:24,777 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:14:24,777 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:14:25,409 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:14:25,867 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:14:25,867 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24, 11] total 48 [2019-10-06 23:14:25,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-06 23:14:25,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-06 23:14:25,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=1887, Unknown=0, NotChecked=0, Total=2256 [2019-10-06 23:14:25,869 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 48 states. [2019-10-06 23:14:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:14:29,089 INFO L93 Difference]: Finished difference Result 178 states and 195 transitions. [2019-10-06 23:14:29,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-06 23:14:29,090 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 66 [2019-10-06 23:14:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:14:29,091 INFO L225 Difference]: With dead ends: 178 [2019-10-06 23:14:29,092 INFO L226 Difference]: Without dead ends: 95 [2019-10-06 23:14:29,093 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 155 SyntacticMatches, 20 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2692 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1143, Invalid=6339, Unknown=0, NotChecked=0, Total=7482 [2019-10-06 23:14:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-06 23:14:29,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-10-06 23:14:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-06 23:14:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2019-10-06 23:14:29,142 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 66 [2019-10-06 23:14:29,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:14:29,142 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2019-10-06 23:14:29,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-06 23:14:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2019-10-06 23:14:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-06 23:14:29,143 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:14:29,144 INFO L385 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:14:29,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:14:29,346 INFO L410 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:14:29,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:14:29,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2021040287, now seen corresponding path program 28 times [2019-10-06 23:14:29,347 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:14:29,347 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:14:29,347 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:14:29,348 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:14:29,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:14:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:14:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 45 proven. 76 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-06 23:14:29,613 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:14:29,613 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:14:29,613 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:14:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:14:30,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-06 23:14:30,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:14:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-06 23:14:30,286 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:14:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-06 23:14:30,475 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:14:30,476 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:14:30,476 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:14:30,476 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:14:30,476 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:14:30,476 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:14:30,492 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-06 23:14:30,895 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-06 23:14:30,936 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-06 23:14:30,940 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:14:30,940 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:14:30,941 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 248#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:14:30,941 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 114#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:14:30,941 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 257#(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-06 23:14:30,941 INFO L193 IcfgInterpreter]: Reachable states at location L14 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)|) (= |#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-06 23:14:30,941 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 233#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:14:30,942 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 243#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)))) [2019-10-06 23:14:30,942 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 228#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:14:30,942 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-06 23:14:30,942 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 152#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:14:30,942 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-06 23:14:30,942 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 262#(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-06 23:14:30,943 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 76#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 main_~sum~0) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= main_~sum~0 0) (= main_~sum~0 0) (= 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|) (<= ~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|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= 0 main_~sum~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~sum~0 0) (= main_~sum~0 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0))) (<= 100000 ~MAX~0)) [2019-10-06 23:14:30,943 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 253#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-06 23:14:30,943 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:14:30,943 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 238#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-06 23:14:30,943 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 190#(and (= |old(~SIZE~0)| 0) (= |#NULL.base| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) [2019-10-06 23:14:31,537 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-06 23:14:31,967 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-06 23:14:31,967 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:14:31,968 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 11] total 49 [2019-10-06 23:14:31,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-06 23:14:31,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-06 23:14:31,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1976, Unknown=0, NotChecked=0, Total=2352 [2019-10-06 23:14:31,969 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 49 states. [2019-10-06 23:14:35,274 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-10-06 23:14:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:14:35,360 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-10-06 23:14:35,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-06 23:14:35,361 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 67 [2019-10-06 23:14:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:14:35,362 INFO L225 Difference]: With dead ends: 98 [2019-10-06 23:14:35,362 INFO L226 Difference]: Without dead ends: 71 [2019-10-06 23:14:35,363 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 156 SyntacticMatches, 22 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2414 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=889, Invalid=5273, Unknown=0, NotChecked=0, Total=6162 [2019-10-06 23:14:35,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-06 23:14:35,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-10-06 23:14:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-06 23:14:35,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-06 23:14:35,396 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 67 [2019-10-06 23:14:35,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:14:35,396 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-06 23:14:35,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-06 23:14:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-06 23:14:35,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-06 23:14:35,396 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:14:35,397 INFO L385 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:14:35,600 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:14:35,601 INFO L410 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:14:35,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:14:35,601 INFO L82 PathProgramCache]: Analyzing trace with hash 694942897, now seen corresponding path program 29 times [2019-10-06 23:14:35,602 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:14:35,602 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:14:35,602 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:14:35,602 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:14:35,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:14:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:14:36,561 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-10-06 23:14:36,774 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2019-10-06 23:14:36,978 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 44 [2019-10-06 23:14:37,208 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 49 [2019-10-06 23:14:37,469 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 53 [2019-10-06 23:14:37,716 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-10-06 23:14:37,948 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-10-06 23:14:38,217 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2019-10-06 23:14:38,575 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2019-10-06 23:14:38,926 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2019-10-06 23:14:39,274 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2019-10-06 23:14:39,749 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 77 [2019-10-06 23:14:40,217 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2019-10-06 23:14:40,618 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2019-10-06 23:14:41,123 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2019-10-06 23:14:41,550 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-10-06 23:14:42,015 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-10-06 23:14:42,495 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 78 [2019-10-06 23:14:42,993 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-10-06 23:14:43,413 WARN L191 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-10-06 23:14:43,903 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 90 [2019-10-06 23:14:44,278 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 81 [2019-10-06 23:14:44,674 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2019-10-06 23:14:45,134 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 81 [2019-10-06 23:14:45,522 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 80 [2019-10-06 23:14:45,936 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 82 [2019-10-06 23:14:46,489 WARN L191 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2019-10-06 23:14:46,942 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 85 [2019-10-06 23:14:47,452 WARN L191 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 91 [2019-10-06 23:14:47,933 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 90 [2019-10-06 23:14:48,478 WARN L191 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 84 [2019-10-06 23:14:48,800 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-10-06 23:14:49,228 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 90 [2019-10-06 23:14:49,630 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 81 [2019-10-06 23:14:50,039 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2019-10-06 23:14:50,444 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 84 [2019-10-06 23:14:50,850 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 83 [2019-10-06 23:14:51,250 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 77 [2019-10-06 23:14:51,591 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2019-10-06 23:14:51,927 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 69 [2019-10-06 23:14:52,279 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2019-10-06 23:14:52,642 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-10-06 23:14:52,962 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-10-06 23:14:53,226 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-10-06 23:14:53,507 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-10-06 23:14:53,770 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-10-06 23:14:54,015 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-10-06 23:14:54,249 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-10-06 23:14:54,479 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-10-06 23:14:54,680 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-10-06 23:14:54,896 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-10-06 23:14:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 36 proven. 294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:14:55,739 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:14:55,740 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:14:55,740 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:14:56,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-06 23:14:56,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:14:56,261 WARN L254 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 218 conjunts are in the unsatisfiable core [2019-10-06 23:14:56,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:15:10,198 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 268 DAG size of output: 259