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/standard_copy5_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:30,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:30,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:30,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:30,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:30,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:30,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:30,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:30,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:30,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:30,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:30,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:30,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:30,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:30,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:30,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:30,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:30,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:30,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:30,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:30,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:30,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:30,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:30,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:30,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:30,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:30,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:30,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:30,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:30,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:30,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:30,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:30,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:30,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:30,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:30,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:30,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:30,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:30,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:30,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:30,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:30,147 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:33:30,179 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:30,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:30,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:30,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:30,183 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:30,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:30,183 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:30,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:30,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:30,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:30,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:30,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:30,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:30,187 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:30,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:30,187 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:30,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:30,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:30,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:30,188 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:30,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:30,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:30,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:30,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:30,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:30,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:30,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:30,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:30,190 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:33:30,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:30,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:30,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:30,481 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:30,481 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:30,482 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy5_ground-2.i [2019-10-13 21:33:30,540 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1a91186d/c92c0b14411f43bd8417a31ed833f515/FLAG8195da9e8 [2019-10-13 21:33:30,980 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:30,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy5_ground-2.i [2019-10-13 21:33:30,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1a91186d/c92c0b14411f43bd8417a31ed833f515/FLAG8195da9e8 [2019-10-13 21:33:31,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1a91186d/c92c0b14411f43bd8417a31ed833f515 [2019-10-13 21:33:31,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:31,371 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:31,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:31,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:31,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:31,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4432024b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31, skipping insertion in model container [2019-10-13 21:33:31,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,393 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:31,416 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:31,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:31,666 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:31,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:31,716 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:31,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31 WrapperNode [2019-10-13 21:33:31,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:31,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:31,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:31,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:31,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:31,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:31,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:31,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:31,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (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:33:31,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:31,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:31,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:31,936 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:31,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:32,447 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:32,447 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-13 21:33:32,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:32 BoogieIcfgContainer [2019-10-13 21:33:32,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:32,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:32,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:32,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:32,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:31" (1/3) ... [2019-10-13 21:33:32,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c208127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:32, skipping insertion in model container [2019-10-13 21:33:32,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (2/3) ... [2019-10-13 21:33:32,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c208127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:32, skipping insertion in model container [2019-10-13 21:33:32,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:32" (3/3) ... [2019-10-13 21:33:32,456 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy5_ground-2.i [2019-10-13 21:33:32,464 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:32,471 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:32,480 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:32,503 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:32,503 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:32,503 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:32,504 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:32,504 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:32,504 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:32,504 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:32,504 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:32,520 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-13 21:33:32,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:33:32,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:32,527 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:32,528 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:32,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:32,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1854431878, now seen corresponding path program 1 times [2019-10-13 21:33:32,540 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:32,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909763441] [2019-10-13 21:33:32,541 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,541 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:32,703 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:33:32,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909763441] [2019-10-13 21:33:32,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:32,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:32,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429599299] [2019-10-13 21:33:32,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:32,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:32,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:32,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:32,730 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-13 21:33:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:32,769 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2019-10-13 21:33:32,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:32,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 21:33:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:32,780 INFO L225 Difference]: With dead ends: 41 [2019-10-13 21:33:32,780 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:33:32,784 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:33:32,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:33:32,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 21:33:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 21:33:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-10-13 21:33:32,830 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 16 [2019-10-13 21:33:32,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:32,830 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-10-13 21:33:32,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-10-13 21:33:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:33:32,832 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:32,832 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:32,833 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:32,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:32,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1492741861, now seen corresponding path program 1 times [2019-10-13 21:33:32,834 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:32,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754731047] [2019-10-13 21:33:32,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,835 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:32,899 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:33:32,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754731047] [2019-10-13 21:33:32,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:32,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:32,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208517633] [2019-10-13 21:33:32,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:32,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:32,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:32,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:32,903 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 3 states. [2019-10-13 21:33:32,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:32,946 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2019-10-13 21:33:32,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:32,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 21:33:32,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:32,948 INFO L225 Difference]: With dead ends: 39 [2019-10-13 21:33:32,948 INFO L226 Difference]: Without dead ends: 26 [2019-10-13 21:33:32,949 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:33:32,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-13 21:33:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-13 21:33:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 21:33:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-10-13 21:33:32,957 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2019-10-13 21:33:32,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:32,957 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-13 21:33:32,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:32,958 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-10-13 21:33:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:33:32,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:32,959 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:32,959 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:32,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:32,960 INFO L82 PathProgramCache]: Analyzing trace with hash -528222000, now seen corresponding path program 1 times [2019-10-13 21:33:32,960 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:32,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441775856] [2019-10-13 21:33:32,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:33:33,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441775856] [2019-10-13 21:33:33,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758091781] [2019-10-13 21:33:33,069 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:33:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:33,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:33,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:33:33,213 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:33:33,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1840177154] [2019-10-13 21:33:33,290 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:33:33,290 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:33,301 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:33,308 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:33,309 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:33,503 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:35,016 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:35,038 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:35,044 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:35,045 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:35,045 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 307#(and (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:35,045 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 317#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:35,046 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 312#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:35,046 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 321#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:35,046 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:35,046 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 297#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* main_~x~0 4) |main_~#a6~0.offset|)))) [2019-10-13 21:33:35,050 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:35,051 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:35,052 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:35,052 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:33:35,052 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 326#(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:35,053 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:35,053 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:35,053 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 302#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) [2019-10-13 21:33:35,053 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 292#(and (<= 100000 main_~a~0) (<= 0 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:35,054 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-13 21:33:35,055 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:35,362 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:35,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:35,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728252224] [2019-10-13 21:33:35,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:35,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:35,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:35,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:35,366 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 18 states. [2019-10-13 21:33:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:36,065 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2019-10-13 21:33:36,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:36,065 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-10-13 21:33:36,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:36,066 INFO L225 Difference]: With dead ends: 62 [2019-10-13 21:33:36,066 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 21:33:36,069 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:36,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 21:33:36,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2019-10-13 21:33:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 21:33:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-10-13 21:33:36,081 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 22 [2019-10-13 21:33:36,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:36,082 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-10-13 21:33:36,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-10-13 21:33:36,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:33:36,084 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:36,084 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:36,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:36,294 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:36,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:36,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1489745050, now seen corresponding path program 2 times [2019-10-13 21:33:36,296 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:36,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041085284] [2019-10-13 21:33:36,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:36,297 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:36,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:33:36,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041085284] [2019-10-13 21:33:36,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282177478] [2019-10-13 21:33:36,443 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:33:36,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:36,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:36,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:36,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:36,531 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:33:36,531 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:33:36,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [804205244] [2019-10-13 21:33:36,559 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:33:36,559 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:36,560 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:36,560 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:36,560 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:36,613 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:37,728 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:37,737 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:37,740 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:37,741 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:37,741 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 307#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:37,741 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 317#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:37,741 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 312#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:37,742 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 321#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:37,742 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,742 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 297#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* main_~x~0 4) |main_~#a6~0.offset|)))) [2019-10-13 21:33:37,742 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,742 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,743 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:37,743 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:33:37,743 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 326#(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:37,743 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,743 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:37,744 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 302#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) [2019-10-13 21:33:37,744 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 292#(and (<= 100000 main_~a~0) (<= 0 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:37,744 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-13 21:33:37,744 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:38,000 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:38,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-13 21:33:38,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692645608] [2019-10-13 21:33:38,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:33:38,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:38,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:33:38,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:33:38,003 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 19 states. [2019-10-13 21:33:38,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:38,720 INFO L93 Difference]: Finished difference Result 84 states and 114 transitions. [2019-10-13 21:33:38,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:38,721 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-10-13 21:33:38,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:38,722 INFO L225 Difference]: With dead ends: 84 [2019-10-13 21:33:38,722 INFO L226 Difference]: Without dead ends: 63 [2019-10-13 21:33:38,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:33:38,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-13 21:33:38,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2019-10-13 21:33:38,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 21:33:38,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-10-13 21:33:38,734 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 30 [2019-10-13 21:33:38,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:38,735 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-10-13 21:33:38,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 21:33:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-10-13 21:33:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 21:33:38,736 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:38,736 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:38,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:38,949 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:38,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash 11000486, now seen corresponding path program 3 times [2019-10-13 21:33:38,950 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:38,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186970137] [2019-10-13 21:33:38,950 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:38,951 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:38,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-13 21:33:39,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186970137] [2019-10-13 21:33:39,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30050828] [2019-10-13 21:33:39,071 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:33:39,172 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:39,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:39,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:33:39,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-13 21:33:39,192 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-13 21:33:39,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [390212621] [2019-10-13 21:33:39,252 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:33:39,252 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:39,253 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:39,253 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:39,253 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:39,276 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:39,953 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:40,346 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:40,354 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:40,358 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:40,359 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:40,359 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 307#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:40,359 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 317#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:40,359 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 312#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:40,360 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 321#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:40,360 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,360 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 297#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* main_~x~0 4) |main_~#a6~0.offset|)))) [2019-10-13 21:33:40,360 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,360 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,361 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:40,361 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:33:40,361 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 326#(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:40,361 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,361 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:40,361 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 302#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) [2019-10-13 21:33:40,362 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 292#(and (<= 100000 main_~a~0) (<= 0 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:40,362 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-13 21:33:40,362 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,622 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:40,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 23 [2019-10-13 21:33:40,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754838285] [2019-10-13 21:33:40,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 21:33:40,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:40,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 21:33:40,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:33:40,627 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 23 states. [2019-10-13 21:33:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:41,355 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2019-10-13 21:33:41,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 21:33:41,356 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-10-13 21:33:41,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:41,357 INFO L225 Difference]: With dead ends: 113 [2019-10-13 21:33:41,357 INFO L226 Difference]: Without dead ends: 69 [2019-10-13 21:33:41,358 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=1268, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 21:33:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-13 21:33:41,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-10-13 21:33:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 21:33:41,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-10-13 21:33:41,370 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 50 [2019-10-13 21:33:41,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:41,370 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-10-13 21:33:41,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 21:33:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-10-13 21:33:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:33:41,372 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:41,372 INFO L380 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:41,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:41,576 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:41,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:41,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1190337914, now seen corresponding path program 4 times [2019-10-13 21:33:41,577 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:41,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615835686] [2019-10-13 21:33:41,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:41,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:41,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-13 21:33:41,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615835686] [2019-10-13 21:33:41,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018347393] [2019-10-13 21:33:41,772 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:33:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:41,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:33:41,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-13 21:33:41,906 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-13 21:33:42,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1671030118] [2019-10-13 21:33:42,086 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:33:42,086 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:42,086 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:42,087 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:42,087 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:42,116 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:42,373 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:43,103 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:43,109 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:43,113 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:43,113 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:43,113 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 307#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:43,113 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 317#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:43,114 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 312#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:43,114 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 321#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:43,114 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,114 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 297#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* main_~x~0 4) |main_~#a6~0.offset|)))) [2019-10-13 21:33:43,114 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,115 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,115 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:43,115 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:33:43,115 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 326#(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:43,115 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,115 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:43,116 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 302#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:33:43,116 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 292#(and (<= 100000 main_~a~0) (<= 0 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:43,116 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-13 21:33:43,116 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:43,405 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:43,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-13 21:33:43,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469126882] [2019-10-13 21:33:43,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 21:33:43,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:43,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 21:33:43,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:33:43,415 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 35 states. [2019-10-13 21:33:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:44,606 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2019-10-13 21:33:44,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-13 21:33:44,607 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 56 [2019-10-13 21:33:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:44,609 INFO L225 Difference]: With dead ends: 125 [2019-10-13 21:33:44,609 INFO L226 Difference]: Without dead ends: 81 [2019-10-13 21:33:44,611 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=934, Invalid=3098, Unknown=0, NotChecked=0, Total=4032 [2019-10-13 21:33:44,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-13 21:33:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2019-10-13 21:33:44,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 21:33:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2019-10-13 21:33:44,622 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 56 [2019-10-13 21:33:44,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:44,622 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2019-10-13 21:33:44,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-13 21:33:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2019-10-13 21:33:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-13 21:33:44,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:44,624 INFO L380 BasicCegarLoop]: trace histogram [22, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:44,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:44,827 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:44,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:44,828 INFO L82 PathProgramCache]: Analyzing trace with hash -142820794, now seen corresponding path program 5 times [2019-10-13 21:33:44,828 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:44,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124222230] [2019-10-13 21:33:44,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:44,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:44,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-10-13 21:33:45,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124222230] [2019-10-13 21:33:45,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997343348] [2019-10-13 21:33:45,027 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:45,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 21:33:45,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:45,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-13 21:33:45,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-13 21:33:45,913 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-10-13 21:33:46,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [278013772] [2019-10-13 21:33:46,016 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:33:46,016 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:46,017 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:46,017 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:46,017 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:46,042 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:47,028 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:47,035 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:47,037 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:47,038 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:47,038 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 307#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:47,038 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 317#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:47,038 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 312#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:47,038 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 321#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:47,039 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,039 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 297#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* main_~x~0 4) |main_~#a6~0.offset|)))) [2019-10-13 21:33:47,039 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,039 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,039 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:47,040 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:47,040 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 326#(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:47,040 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,040 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:47,040 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 302#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) [2019-10-13 21:33:47,040 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 292#(and (<= 100000 main_~a~0) (<= 0 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:47,041 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-13 21:33:47,041 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,298 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:47,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9, 11] total 28 [2019-10-13 21:33:47,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749409798] [2019-10-13 21:33:47,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-13 21:33:47,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:47,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-13 21:33:47,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:33:47,302 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 28 states. [2019-10-13 21:33:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:48,476 INFO L93 Difference]: Finished difference Result 158 states and 208 transitions. [2019-10-13 21:33:48,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-13 21:33:48,477 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 68 [2019-10-13 21:33:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:48,478 INFO L225 Difference]: With dead ends: 158 [2019-10-13 21:33:48,478 INFO L226 Difference]: Without dead ends: 121 [2019-10-13 21:33:48,480 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=520, Invalid=1832, Unknown=0, NotChecked=0, Total=2352 [2019-10-13 21:33:48,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-13 21:33:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2019-10-13 21:33:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-13 21:33:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2019-10-13 21:33:48,495 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 68 [2019-10-13 21:33:48,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:48,496 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2019-10-13 21:33:48,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-13 21:33:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2019-10-13 21:33:48,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 21:33:48,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:48,499 INFO L380 BasicCegarLoop]: trace histogram [22, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:48,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:48,704 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:48,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:48,705 INFO L82 PathProgramCache]: Analyzing trace with hash -866740026, now seen corresponding path program 6 times [2019-10-13 21:33:48,706 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:48,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83724435] [2019-10-13 21:33:48,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:48,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:48,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-10-13 21:33:49,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83724435] [2019-10-13 21:33:49,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090115504] [2019-10-13 21:33:49,175 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 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-13 21:33:49,360 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:49,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:49,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 21:33:49,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-10-13 21:33:49,400 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-10-13 21:33:50,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [27249978] [2019-10-13 21:33:50,485 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:33:50,486 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:50,488 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:50,488 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:50,488 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:50,503 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:51,480 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:51,488 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:51,491 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:51,491 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:51,492 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 317#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:51,492 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 307#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:51,492 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 312#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:51,492 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 321#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:51,492 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:51,493 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 297#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* main_~x~0 4) |main_~#a6~0.offset|)))) [2019-10-13 21:33:51,493 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:51,493 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:51,493 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:51,493 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:33:51,493 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 326#(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:51,494 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:51,494 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:51,494 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 302#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) [2019-10-13 21:33:51,494 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 292#(and (<= 100000 main_~a~0) (<= 0 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:51,494 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-13 21:33:51,495 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:51,929 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:51,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 11] total 59 [2019-10-13 21:33:51,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717067010] [2019-10-13 21:33:51,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-13 21:33:51,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:51,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-13 21:33:51,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1205, Invalid=2217, Unknown=0, NotChecked=0, Total=3422 [2019-10-13 21:33:51,936 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 59 states. [2019-10-13 21:33:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:54,503 INFO L93 Difference]: Finished difference Result 229 states and 264 transitions. [2019-10-13 21:33:54,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-13 21:33:54,504 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 108 [2019-10-13 21:33:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:54,505 INFO L225 Difference]: With dead ends: 229 [2019-10-13 21:33:54,506 INFO L226 Difference]: Without dead ends: 145 [2019-10-13 21:33:54,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2799 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3514, Invalid=8918, Unknown=0, NotChecked=0, Total=12432 [2019-10-13 21:33:54,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-13 21:33:54,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 136. [2019-10-13 21:33:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-13 21:33:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2019-10-13 21:33:54,526 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 108 [2019-10-13 21:33:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:54,526 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2019-10-13 21:33:54,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-13 21:33:54,527 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2019-10-13 21:33:54,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-13 21:33:54,529 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:54,529 INFO L380 BasicCegarLoop]: trace histogram [46, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:54,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:54,734 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:54,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:54,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1674581946, now seen corresponding path program 7 times [2019-10-13 21:33:54,734 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:54,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879248977] [2019-10-13 21:33:54,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:54,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:54,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1606 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 1501 trivial. 0 not checked. [2019-10-13 21:33:55,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879248977] [2019-10-13 21:33:55,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798891849] [2019-10-13 21:33:55,604 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 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-13 21:33:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:55,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-13 21:33:55,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1606 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-10-13 21:33:57,132 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1606 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-10-13 21:33:59,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [378804019] [2019-10-13 21:33:59,816 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:33:59,817 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:59,817 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:59,817 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:59,817 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:59,832 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:00,850 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:00,855 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:00,857 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:00,857 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:00,857 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 317#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:00,858 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 307#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:00,858 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 312#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:00,858 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 321#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:00,858 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:00,858 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 297#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* main_~x~0 4) |main_~#a6~0.offset|)))) [2019-10-13 21:34:00,859 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:00,859 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:00,859 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:34:00,859 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:34:00,859 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 326#(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:34:00,859 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:00,860 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:00,860 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 302#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) [2019-10-13 21:34:00,860 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 292#(and (<= 100000 main_~a~0) (<= 0 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:34:00,860 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-13 21:34:00,860 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:01,426 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:01,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 49, 49, 11] total 121 [2019-10-13 21:34:01,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800614214] [2019-10-13 21:34:01,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-10-13 21:34:01,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:01,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-10-13 21:34:01,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4724, Invalid=9796, Unknown=0, NotChecked=0, Total=14520 [2019-10-13 21:34:01,433 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand 121 states. [2019-10-13 21:34:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:10,077 INFO L93 Difference]: Finished difference Result 282 states and 346 transitions. [2019-10-13 21:34:10,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-10-13 21:34:10,078 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 132 [2019-10-13 21:34:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:10,079 INFO L225 Difference]: With dead ends: 282 [2019-10-13 21:34:10,080 INFO L226 Difference]: Without dead ends: 198 [2019-10-13 21:34:10,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12007 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14196, Invalid=41736, Unknown=0, NotChecked=0, Total=55932 [2019-10-13 21:34:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-13 21:34:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 189. [2019-10-13 21:34:10,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-13 21:34:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 195 transitions. [2019-10-13 21:34:10,104 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 195 transitions. Word has length 132 [2019-10-13 21:34:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:10,105 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 195 transitions. [2019-10-13 21:34:10,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-10-13 21:34:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 195 transitions. [2019-10-13 21:34:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-13 21:34:10,108 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:10,108 INFO L380 BasicCegarLoop]: trace histogram [94, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:10,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:10,313 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:10,314 INFO L82 PathProgramCache]: Analyzing trace with hash -723793147, now seen corresponding path program 8 times [2019-10-13 21:34:10,314 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:10,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643182246] [2019-10-13 21:34:10,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:10,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:10,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY