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-examples/sanfoundry_02_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:32:36,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:32:36,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:32:36,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:32:36,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:32:36,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:32:36,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:32:36,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:32:36,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:32:36,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:32:36,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:32:36,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:32:36,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:32:36,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:32:36,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:32:36,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:32:36,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:32:36,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:32:36,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:32:36,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:32:36,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:32:36,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:32:36,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:32:36,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:32:36,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:32:36,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:32:36,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:32:36,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:32:36,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:32:36,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:32:36,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:32:36,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:32:36,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:32:36,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:32:36,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:32:36,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:32:36,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:32:36,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:32:36,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:32:36,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:32:36,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:32:36,820 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-13 21:32:36,842 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:32:36,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:32:36,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:32:36,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:32:36,845 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:32:36,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:32:36,845 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:32:36,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:32:36,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:32:36,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:32:36,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:32:36,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:32:36,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:32:36,848 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:32:36,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:32:36,848 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:32:36,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:32:36,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:32:36,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:32:36,849 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:32:36,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:32:36,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:36,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:32:36,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:32:36,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:32:36,851 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:32:36,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:32:36,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:32:36,851 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-13 21:32:37,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:32:37,128 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:32:37,132 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:32:37,133 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:32:37,133 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:32:37,134 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_02_ground.i [2019-10-13 21:32:37,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985b90ae7/2a4163cc4c19417cac7aef8da4fac431/FLAG90aaef747 [2019-10-13 21:32:37,624 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:32:37,625 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_02_ground.i [2019-10-13 21:32:37,631 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985b90ae7/2a4163cc4c19417cac7aef8da4fac431/FLAG90aaef747 [2019-10-13 21:32:37,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985b90ae7/2a4163cc4c19417cac7aef8da4fac431 [2019-10-13 21:32:38,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:32:38,009 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:32:38,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:38,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:32:38,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:32:38,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:37" (1/1) ... [2019-10-13 21:32:38,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b536ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38, skipping insertion in model container [2019-10-13 21:32:38,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:37" (1/1) ... [2019-10-13 21:32:38,029 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:32:38,050 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:32:38,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:38,258 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:32:38,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:38,301 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:32:38,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38 WrapperNode [2019-10-13 21:32:38,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:38,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:32:38,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:32:38,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:32:38,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (1/1) ... [2019-10-13 21:32:38,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:32:38,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:32:38,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:32:38,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:32:38,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (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-13 21:32:38,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:32:38,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:32:38,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:32:38,488 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:32:38,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:32:38,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:32:38,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:32:38,489 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:32:38,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:32:38,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:32:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:32:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:32:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:32:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:32:39,027 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:32:39,028 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-13 21:32:39,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:39 BoogieIcfgContainer [2019-10-13 21:32:39,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:32:39,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:32:39,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:32:39,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:32:39,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:32:37" (1/3) ... [2019-10-13 21:32:39,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e430569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:39, skipping insertion in model container [2019-10-13 21:32:39,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:38" (2/3) ... [2019-10-13 21:32:39,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e430569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:39, skipping insertion in model container [2019-10-13 21:32:39,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:39" (3/3) ... [2019-10-13 21:32:39,038 INFO L109 eAbstractionObserver]: Analyzing ICFG sanfoundry_02_ground.i [2019-10-13 21:32:39,049 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:32:39,057 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:32:39,069 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:32:39,096 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:32:39,096 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:32:39,096 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:32:39,096 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:32:39,097 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:32:39,097 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:32:39,097 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:32:39,098 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:32:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-13 21:32:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:32:39,119 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:39,120 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:39,122 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:39,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:39,127 INFO L82 PathProgramCache]: Analyzing trace with hash -556049670, now seen corresponding path program 1 times [2019-10-13 21:32:39,136 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:39,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964895146] [2019-10-13 21:32:39,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:39,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:39,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:39,306 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-13 21:32:39,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964895146] [2019-10-13 21:32:39,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:39,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:39,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834649727] [2019-10-13 21:32:39,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:39,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:39,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:39,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:39,337 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2019-10-13 21:32:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:39,392 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-10-13 21:32:39,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:39,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:32:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:39,411 INFO L225 Difference]: With dead ends: 39 [2019-10-13 21:32:39,411 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 21:32:39,417 INFO L600 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-13 21:32:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 21:32:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 21:32:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 21:32:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-13 21:32:39,482 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2019-10-13 21:32:39,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:39,483 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-13 21:32:39,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:39,484 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-13 21:32:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:32:39,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:39,488 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:39,490 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:39,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:39,492 INFO L82 PathProgramCache]: Analyzing trace with hash -275638623, now seen corresponding path program 1 times [2019-10-13 21:32:39,492 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:39,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637916800] [2019-10-13 21:32:39,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:39,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:39,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:39,567 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-13 21:32:39,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637916800] [2019-10-13 21:32:39,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:39,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:39,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810581890] [2019-10-13 21:32:39,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:39,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:39,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:39,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:39,572 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-13 21:32:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:39,608 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-13 21:32:39,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:39,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:32:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:39,610 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:32:39,611 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:32:39,613 INFO L600 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-13 21:32:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:32:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 21:32:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 21:32:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-13 21:32:39,627 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2019-10-13 21:32:39,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:39,627 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-13 21:32:39,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-13 21:32:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:32:39,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:39,630 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:39,630 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:39,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:39,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1658314951, now seen corresponding path program 1 times [2019-10-13 21:32:39,631 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:39,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061529694] [2019-10-13 21:32:39,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:39,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:39,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:39,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061529694] [2019-10-13 21:32:39,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983306687] [2019-10-13 21:32:39,724 INFO L94 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-13 21:32:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:39,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:39,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:39,817 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:39,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1927072723] [2019-10-13 21:32:39,885 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:32:39,885 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:39,891 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:39,900 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:39,901 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:40,055 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:40,301 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:40,330 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:40,338 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:40,338 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:40,339 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 141#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:40,339 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 146#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:40,339 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:40,340 INFO L193 IcfgInterpreter]: Reachable states at location L26-2 satisfy 121#(<= 2 main_~i~0) [2019-10-13 21:32:40,340 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 126#(and (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:40,340 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:40,341 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:40,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:40,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:40,341 INFO L193 IcfgInterpreter]: Reachable states at location L40 satisfy 131#(and (< main_~x~0 100000) (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~x~0 4) |main_~#array~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:40,342 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:32:40,342 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:40,342 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:32:40,748 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:40,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:32:40,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457734418] [2019-10-13 21:32:40,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:32:40,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:40,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:32:40,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:32:40,754 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 18 states. [2019-10-13 21:32:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:41,545 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-10-13 21:32:41,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 21:32:41,545 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-13 21:32:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:41,547 INFO L225 Difference]: With dead ends: 46 [2019-10-13 21:32:41,547 INFO L226 Difference]: Without dead ends: 32 [2019-10-13 21:32:41,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=979, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:32:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-13 21:32:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-10-13 21:32:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 21:32:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-13 21:32:41,559 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 14 [2019-10-13 21:32:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:41,559 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-13 21:32:41,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:32:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-13 21:32:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:32:41,561 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:41,561 INFO L380 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:41,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:41,766 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:41,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:41,767 INFO L82 PathProgramCache]: Analyzing trace with hash -716975334, now seen corresponding path program 2 times [2019-10-13 21:32:41,768 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:41,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173690991] [2019-10-13 21:32:41,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:41,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:41,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:32:41,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173690991] [2019-10-13 21:32:41,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174254551] [2019-10-13 21:32:41,883 INFO L92 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-13 21:32:41,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:32:41,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:41,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:32:41,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:32:41,949 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:32:42,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [252727029] [2019-10-13 21:32:42,017 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:32:42,017 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:42,018 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:42,018 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:42,018 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:42,053 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:42,184 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:42,205 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:42,211 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:42,211 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:42,212 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 141#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:42,212 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 146#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:42,212 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:42,212 INFO L193 IcfgInterpreter]: Reachable states at location L26-2 satisfy 121#(<= 2 main_~i~0) [2019-10-13 21:32:42,213 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 126#(and (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:42,213 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:42,213 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:42,213 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:42,214 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:42,214 INFO L193 IcfgInterpreter]: Reachable states at location L40 satisfy 131#(and (< main_~x~0 100000) (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~x~0 4) |main_~#array~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:42,214 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:32:42,215 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:42,215 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:32:42,519 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:42,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 22 [2019-10-13 21:32:42,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494958581] [2019-10-13 21:32:42,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 21:32:42,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:42,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 21:32:42,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-10-13 21:32:42,524 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 22 states. [2019-10-13 21:32:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:43,445 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2019-10-13 21:32:43,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-13 21:32:43,445 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-10-13 21:32:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:43,446 INFO L225 Difference]: With dead ends: 60 [2019-10-13 21:32:43,447 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 21:32:43,448 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=484, Invalid=1868, Unknown=0, NotChecked=0, Total=2352 [2019-10-13 21:32:43,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 21:32:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-10-13 21:32:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 21:32:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-13 21:32:43,458 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 22 [2019-10-13 21:32:43,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:43,458 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-13 21:32:43,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 21:32:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-13 21:32:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 21:32:43,460 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:43,460 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:43,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:43,673 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:43,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:43,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1055620890, now seen corresponding path program 3 times [2019-10-13 21:32:43,673 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:43,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683539792] [2019-10-13 21:32:43,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:32:43,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683539792] [2019-10-13 21:32:43,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002382846] [2019-10-13 21:32:43,930 INFO L92 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-13 21:32:44,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:32:44,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:44,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:32:44,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:32:44,049 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:32:44,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [435395557] [2019-10-13 21:32:44,256 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:32:44,256 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:44,257 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:44,257 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:44,257 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:44,291 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:44,425 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:44,446 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:44,452 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:44,453 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:44,453 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 141#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:44,454 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 146#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:44,454 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:44,454 INFO L193 IcfgInterpreter]: Reachable states at location L26-2 satisfy 121#(<= 2 main_~i~0) [2019-10-13 21:32:44,454 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 126#(and (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:44,455 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:44,455 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:44,455 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:44,456 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:44,456 INFO L193 IcfgInterpreter]: Reachable states at location L40 satisfy 131#(and (< main_~x~0 100000) (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~x~0 4) |main_~#array~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:44,456 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:32:44,457 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:44,457 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:32:44,842 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:44,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 36 [2019-10-13 21:32:44,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739785120] [2019-10-13 21:32:44,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-13 21:32:44,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:44,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-13 21:32:44,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=906, Unknown=0, NotChecked=0, Total=1260 [2019-10-13 21:32:44,847 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 36 states. [2019-10-13 21:32:46,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:46,927 INFO L93 Difference]: Finished difference Result 92 states and 126 transitions. [2019-10-13 21:32:46,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-13 21:32:46,928 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 32 [2019-10-13 21:32:46,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:46,929 INFO L225 Difference]: With dead ends: 92 [2019-10-13 21:32:46,930 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 21:32:46,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2223 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1903, Invalid=5929, Unknown=0, NotChecked=0, Total=7832 [2019-10-13 21:32:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 21:32:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-13 21:32:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-13 21:32:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-13 21:32:46,948 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 32 [2019-10-13 21:32:46,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:46,948 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-13 21:32:46,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-13 21:32:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-13 21:32:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:32:46,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:46,950 INFO L380 BasicCegarLoop]: trace histogram [24, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:47,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:47,161 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:47,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:47,162 INFO L82 PathProgramCache]: Analyzing trace with hash -171811398, now seen corresponding path program 4 times [2019-10-13 21:32:47,162 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:47,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380024797] [2019-10-13 21:32:47,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:47,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:47,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-13 21:32:47,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380024797] [2019-10-13 21:32:47,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486194859] [2019-10-13 21:32:47,709 INFO L92 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-13 21:32:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:47,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-13 21:32:47,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:32:47,878 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:32:49,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [650628075] [2019-10-13 21:32:49,149 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:32:49,149 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:49,150 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:49,150 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:49,150 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:49,185 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:49,284 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:49,297 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:49,301 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:49,301 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:49,301 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 141#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:49,302 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 146#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:49,302 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:49,302 INFO L193 IcfgInterpreter]: Reachable states at location L26-2 satisfy 121#(<= 2 main_~i~0) [2019-10-13 21:32:49,303 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 126#(and (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:49,303 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:49,304 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:49,304 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:49,304 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:49,304 INFO L193 IcfgInterpreter]: Reachable states at location L40 satisfy 131#(and (< main_~x~0 100000) (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~x~0 4) |main_~#array~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:49,307 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:32:49,307 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:49,307 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:32:49,702 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:49,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27, 27, 11] total 62 [2019-10-13 21:32:49,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125133510] [2019-10-13 21:32:49,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-13 21:32:49,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:49,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-13 21:32:49,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1355, Invalid=2427, Unknown=0, NotChecked=0, Total=3782 [2019-10-13 21:32:49,707 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 62 states. [2019-10-13 21:32:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:54,988 INFO L93 Difference]: Finished difference Result 156 states and 216 transitions. [2019-10-13 21:32:54,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-10-13 21:32:54,989 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 58 [2019-10-13 21:32:54,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:54,992 INFO L225 Difference]: With dead ends: 156 [2019-10-13 21:32:54,992 INFO L226 Difference]: Without dead ends: 120 [2019-10-13 21:32:55,000 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7629 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=7779, Invalid=19943, Unknown=0, NotChecked=0, Total=27722 [2019-10-13 21:32:55,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-13 21:32:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2019-10-13 21:32:55,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-13 21:32:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2019-10-13 21:32:55,017 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 58 [2019-10-13 21:32:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:55,017 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2019-10-13 21:32:55,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-13 21:32:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2019-10-13 21:32:55,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 21:32:55,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:55,021 INFO L380 BasicCegarLoop]: trace histogram [50, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:55,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:55,229 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:55,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:55,229 INFO L82 PathProgramCache]: Analyzing trace with hash 214185690, now seen corresponding path program 5 times [2019-10-13 21:32:55,230 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:55,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102262735] [2019-10-13 21:32:55,230 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:55,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:55,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-10-13 21:32:56,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102262735] [2019-10-13 21:32:56,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771831850] [2019-10-13 21:32:56,348 INFO L92 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-13 21:33:19,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-10-13 21:33:19,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:19,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-13 21:33:19,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-10-13 21:33:19,239 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-10-13 21:33:21,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1788687935] [2019-10-13 21:33:21,973 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:21,973 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:21,974 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:21,974 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:21,974 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:22,008 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:22,110 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:33:22,124 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:22,127 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:22,127 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:22,127 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 141#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:33:22,127 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 146#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:33:22,128 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:22,128 INFO L193 IcfgInterpreter]: Reachable states at location L26-2 satisfy 121#(<= 2 main_~i~0) [2019-10-13 21:33:22,129 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 126#(and (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:22,129 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:22,132 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 21:33:22,132 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:22,132 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:22,132 INFO L193 IcfgInterpreter]: Reachable states at location L40 satisfy 131#(and (< main_~x~0 100000) (<= 2 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem10| (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~x~0 4) |main_~#array~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:22,132 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:33:22,133 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:33:22,134 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:33:22,630 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:22,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51, 11] total 110 [2019-10-13 21:33:22,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842324519] [2019-10-13 21:33:22,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-10-13 21:33:22,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:22,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-10-13 21:33:22,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4979, Invalid=7011, Unknown=0, NotChecked=0, Total=11990 [2019-10-13 21:33:22,637 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand 110 states.