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_copy8_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:46,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:46,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:46,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:46,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:46,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:46,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:46,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:46,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:46,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:46,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:46,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:46,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:46,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:46,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:46,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:46,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:46,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:46,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:46,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:46,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:47,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:47,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:47,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:47,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:47,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:47,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:47,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:47,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:47,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:47,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:47,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:47,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:47,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:47,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:47,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:47,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:47,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:47,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:47,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:47,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:47,015 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:47,036 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:47,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:47,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:47,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:47,038 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:47,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:47,039 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:47,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:47,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:47,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:47,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:47,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:47,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:47,041 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:47,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:47,042 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:47,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:47,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:47,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:47,042 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:47,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:47,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:47,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:47,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:47,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:47,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:47,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:47,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:47,044 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:47,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:47,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:47,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:47,347 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:47,348 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:47,348 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy8_ground-1.i [2019-10-13 21:33:47,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f96bff4/327e1866d8434e88bb40594636759ca4/FLAG8aa6d4019 [2019-10-13 21:33:47,905 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:47,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy8_ground-1.i [2019-10-13 21:33:47,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f96bff4/327e1866d8434e88bb40594636759ca4/FLAG8aa6d4019 [2019-10-13 21:33:48,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f96bff4/327e1866d8434e88bb40594636759ca4 [2019-10-13 21:33:48,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:48,256 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:48,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:48,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:48,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:48,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:48" (1/1) ... [2019-10-13 21:33:48,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f69be82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:48, skipping insertion in model container [2019-10-13 21:33:48,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:48" (1/1) ... [2019-10-13 21:33:48,271 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:48,289 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:48,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:48,464 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:48,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:48,609 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:48,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:48 WrapperNode [2019-10-13 21:33:48,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:48,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:48,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:48,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:48,623 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:48" (1/1) ... [2019-10-13 21:33:48,623 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:48" (1/1) ... [2019-10-13 21:33:48,632 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:48" (1/1) ... [2019-10-13 21:33:48,632 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:48" (1/1) ... [2019-10-13 21:33:48,644 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:48" (1/1) ... [2019-10-13 21:33:48,653 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:48" (1/1) ... [2019-10-13 21:33:48,655 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:48" (1/1) ... [2019-10-13 21:33:48,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:48,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:48,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:48,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:48,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:48" (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:48,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:48,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:48,722 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:48,722 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:48,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:48,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:48,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:48,723 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:48,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:48,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:48,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:48,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:48,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:48,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:49,313 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:49,314 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:33:49,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:49 BoogieIcfgContainer [2019-10-13 21:33:49,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:49,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:49,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:49,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:49,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:48" (1/3) ... [2019-10-13 21:33:49,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae4ecd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:49, skipping insertion in model container [2019-10-13 21:33:49,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:48" (2/3) ... [2019-10-13 21:33:49,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae4ecd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:49, skipping insertion in model container [2019-10-13 21:33:49,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:49" (3/3) ... [2019-10-13 21:33:49,325 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy8_ground-1.i [2019-10-13 21:33:49,335 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:49,344 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:49,355 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:49,383 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:49,383 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:49,384 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:49,384 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:49,384 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:49,384 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:49,385 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:49,385 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-10-13 21:33:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:33:49,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:49,414 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:49,419 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:49,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:49,425 INFO L82 PathProgramCache]: Analyzing trace with hash 585848073, now seen corresponding path program 1 times [2019-10-13 21:33:49,436 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:49,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138108822] [2019-10-13 21:33:49,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:49,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:49,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:49,634 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:49,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138108822] [2019-10-13 21:33:49,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:49,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:49,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821567995] [2019-10-13 21:33:49,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:49,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:49,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:49,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:49,661 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2019-10-13 21:33:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:49,698 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-10-13 21:33:49,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:49,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:33:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:49,710 INFO L225 Difference]: With dead ends: 47 [2019-10-13 21:33:49,710 INFO L226 Difference]: Without dead ends: 24 [2019-10-13 21:33:49,714 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:49,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-13 21:33:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-13 21:33:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:33:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-10-13 21:33:49,761 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 19 [2019-10-13 21:33:49,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:49,762 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-13 21:33:49,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-10-13 21:33:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:33:49,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:49,764 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] [2019-10-13 21:33:49,764 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:49,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:49,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1643282624, now seen corresponding path program 1 times [2019-10-13 21:33:49,765 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:49,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628929790] [2019-10-13 21:33:49,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:49,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:49,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:49,838 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:49,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628929790] [2019-10-13 21:33:49,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:49,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:49,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934886990] [2019-10-13 21:33:49,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:49,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:49,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:49,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:49,847 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 3 states. [2019-10-13 21:33:49,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:49,923 INFO L93 Difference]: Finished difference Result 48 states and 72 transitions. [2019-10-13 21:33:49,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:49,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:33:49,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:49,928 INFO L225 Difference]: With dead ends: 48 [2019-10-13 21:33:49,928 INFO L226 Difference]: Without dead ends: 32 [2019-10-13 21:33:49,930 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:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-13 21:33:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-13 21:33:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:33:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2019-10-13 21:33:49,943 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 20 [2019-10-13 21:33:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:49,943 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-10-13 21:33:49,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2019-10-13 21:33:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:33:49,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:49,946 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, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:49,947 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:49,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:49,947 INFO L82 PathProgramCache]: Analyzing trace with hash 96487886, now seen corresponding path program 1 times [2019-10-13 21:33:49,948 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:49,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287751812] [2019-10-13 21:33:49,950 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:49,950 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:49,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:33:50,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287751812] [2019-10-13 21:33:50,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192335955] [2019-10-13 21:33:50,149 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:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:50,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:50,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:33:50,287 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:33:50,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [472533341] [2019-10-13 21:33:50,344 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:33:50,344 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:50,351 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:50,359 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:50,360 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:50,537 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:51,037 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:51,302 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:52,569 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:52,924 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:52,937 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:52,945 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:52,946 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:52,946 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(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_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:52,946 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:52,947 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(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_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~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:52,947 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-13 21:33:52,947 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:52,947 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:52,948 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* main_~x~0 4) |main_~#a9~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:52,948 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:52,948 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:52,948 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:52,949 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:52,949 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:52,949 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:52,949 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:52,949 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:52,950 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:52,950 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(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_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))))) [2019-10-13 21:33:52,950 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:52,951 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(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_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~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:52,951 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,258 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:53,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:53,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168233550] [2019-10-13 21:33:53,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:53,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:53,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:53,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:53,266 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 18 states. [2019-10-13 21:33:54,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:54,070 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2019-10-13 21:33:54,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:54,071 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2019-10-13 21:33:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:54,072 INFO L225 Difference]: With dead ends: 77 [2019-10-13 21:33:54,072 INFO L226 Difference]: Without dead ends: 52 [2019-10-13 21:33:54,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 75 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:54,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-13 21:33:54,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-10-13 21:33:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 21:33:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-10-13 21:33:54,084 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 28 [2019-10-13 21:33:54,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:54,085 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-10-13 21:33:54,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:54,085 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2019-10-13 21:33:54,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 21:33:54,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:54,086 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:54,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:54,293 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:54,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash -240069559, now seen corresponding path program 2 times [2019-10-13 21:33:54,294 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:54,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678462536] [2019-10-13 21:33:54,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:54,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:54,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-13 21:33:54,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678462536] [2019-10-13 21:33:54,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578172530] [2019-10-13 21:33:54,392 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:54,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:54,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:54,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:54,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-13 21:33:54,514 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-13 21:33:54,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1067325532] [2019-10-13 21:33:54,545 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:33:54,546 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:54,547 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:54,548 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:54,548 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:54,586 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:54,948 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:56,306 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:56,313 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:56,316 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:56,316 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:56,317 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(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_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 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_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:56,317 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,317 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~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_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 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_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:56,317 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-13 21:33:56,317 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:56,318 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,318 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* main_~x~0 4) |main_~#a9~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:56,318 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,318 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,318 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,319 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:56,319 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:56,319 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:56,319 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,319 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:56,320 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,320 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(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_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 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_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) [2019-10-13 21:33:56,320 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:56,320 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~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_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 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_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:56,320 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,617 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:56,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-13 21:33:56,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796197884] [2019-10-13 21:33:56,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:33:56,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:56,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:33:56,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:33:56,619 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 19 states. [2019-10-13 21:33:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:57,480 INFO L93 Difference]: Finished difference Result 114 states and 162 transitions. [2019-10-13 21:33:57,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:57,485 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2019-10-13 21:33:57,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:57,486 INFO L225 Difference]: With dead ends: 114 [2019-10-13 21:33:57,486 INFO L226 Difference]: Without dead ends: 84 [2019-10-13 21:33:57,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:33:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-13 21:33:57,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2019-10-13 21:33:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-13 21:33:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2019-10-13 21:33:57,503 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 39 [2019-10-13 21:33:57,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:57,504 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2019-10-13 21:33:57,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 21:33:57,504 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2019-10-13 21:33:57,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-13 21:33:57,509 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:57,509 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:57,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:57,711 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:57,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:57,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1717335881, now seen corresponding path program 3 times [2019-10-13 21:33:57,712 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:57,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333140286] [2019-10-13 21:33:57,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:57,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:57,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:33:57,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333140286] [2019-10-13 21:33:57,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544730182] [2019-10-13 21:33:57,860 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:57,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:57,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:57,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:33:57,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:33:58,004 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:33:58,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1457505268] [2019-10-13 21:33:58,064 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:33:58,064 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:58,064 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:58,065 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:58,065 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:58,101 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:59,796 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:59,802 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:59,806 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:59,806 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:59,806 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:59,806 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:59,806 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) (<= 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:59,806 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-13 21:33:59,806 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:59,807 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:59,807 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* main_~x~0 4) |main_~#a9~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:59,807 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:59,807 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:59,807 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:59,807 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:59,808 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:59,808 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:59,808 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:59,808 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:59,808 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:59,808 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) [2019-10-13 21:33:59,808 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:59,809 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) (<= 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:59,809 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:00,075 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:00,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 23 [2019-10-13 21:34:00,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789447935] [2019-10-13 21:34:00,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 21:34:00,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:00,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 21:34:00,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:34:00,077 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 23 states. [2019-10-13 21:34:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:00,881 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2019-10-13 21:34:00,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 21:34:00,882 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2019-10-13 21:34:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:00,884 INFO L225 Difference]: With dead ends: 155 [2019-10-13 21:34:00,884 INFO L226 Difference]: Without dead ends: 90 [2019-10-13 21:34:00,886 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=292, Invalid=1268, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 21:34:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-13 21:34:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2019-10-13 21:34:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-13 21:34:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-10-13 21:34:00,898 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 71 [2019-10-13 21:34:00,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:00,899 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-10-13 21:34:00,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 21:34:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-10-13 21:34:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 21:34:00,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:00,901 INFO L380 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:01,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:01,105 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:01,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:01,107 INFO L82 PathProgramCache]: Analyzing trace with hash -407034903, now seen corresponding path program 4 times [2019-10-13 21:34:01,107 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:01,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756453168] [2019-10-13 21:34:01,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:01,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:01,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:34:01,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756453168] [2019-10-13 21:34:01,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029983655] [2019-10-13 21:34:01,313 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:34:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:01,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:34:01,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:34:01,488 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:34:01,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1808966872] [2019-10-13 21:34:01,664 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:34:01,665 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:01,666 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:01,666 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:01,666 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:01,682 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:02,912 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:34:03,302 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:03,307 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:03,309 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:03,310 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:03,310 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(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_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~0.offset_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_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:03,310 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,310 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(and (<= __VERIFIER_assert_~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_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~0.offset_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_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) (<= 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:34:03,310 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-13 21:34:03,310 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:03,310 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,311 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* main_~x~0 4) |main_~#a9~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:03,311 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,311 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,311 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,311 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:03,312 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:03,312 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:03,312 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:03,312 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,312 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,313 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(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_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~0.offset_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_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:34:03,313 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:03,313 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(and (<= __VERIFIER_assert_~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_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~0.offset_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_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) (<= 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:34:03,313 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,640 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:03,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-13 21:34:03,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880566572] [2019-10-13 21:34:03,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 21:34:03,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:03,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 21:34:03,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:34:03,644 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 35 states. [2019-10-13 21:34:04,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:04,825 INFO L93 Difference]: Finished difference Result 167 states and 196 transitions. [2019-10-13 21:34:04,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-13 21:34:04,826 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 77 [2019-10-13 21:34:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:04,827 INFO L225 Difference]: With dead ends: 167 [2019-10-13 21:34:04,827 INFO L226 Difference]: Without dead ends: 102 [2019-10-13 21:34:04,830 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=934, Invalid=3098, Unknown=0, NotChecked=0, Total=4032 [2019-10-13 21:34:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-13 21:34:04,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2019-10-13 21:34:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-13 21:34:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2019-10-13 21:34:04,843 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 77 [2019-10-13 21:34:04,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:04,843 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2019-10-13 21:34:04,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-13 21:34:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2019-10-13 21:34:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 21:34:04,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:04,845 INFO L380 BasicCegarLoop]: trace histogram [22, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:05,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:05,049 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:05,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:05,050 INFO L82 PathProgramCache]: Analyzing trace with hash 745837865, now seen corresponding path program 5 times [2019-10-13 21:34:05,050 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:05,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757837496] [2019-10-13 21:34:05,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:05,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:05,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:34:05,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757837496] [2019-10-13 21:34:05,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202421831] [2019-10-13 21:34:05,467 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:34:07,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 21:34:07,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:07,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-13 21:34:07,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 40 proven. 21 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-10-13 21:34:07,228 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2019-10-13 21:34:07,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [798450079] [2019-10-13 21:34:07,393 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:34:07,393 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:07,394 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:07,394 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:07,394 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:07,412 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:08,249 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:34:09,058 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:09,067 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:09,070 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:09,070 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:09,070 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~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_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:09,071 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,071 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~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_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:09,071 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-13 21:34:09,071 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:09,071 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,072 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* main_~x~0 4) |main_~#a9~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:09,072 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,072 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,072 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,072 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:09,073 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:34:09,073 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:09,073 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:09,073 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,073 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,073 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~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_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) [2019-10-13 21:34:09,074 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:09,074 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~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_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:09,074 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:09,507 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:09,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 11, 9, 11] total 51 [2019-10-13 21:34:09,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931436556] [2019-10-13 21:34:09,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-13 21:34:09,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:09,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-13 21:34:09,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=2061, Unknown=0, NotChecked=0, Total=2550 [2019-10-13 21:34:09,511 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 51 states. [2019-10-13 21:34:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:12,860 INFO L93 Difference]: Finished difference Result 232 states and 314 transitions. [2019-10-13 21:34:12,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-13 21:34:12,861 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 89 [2019-10-13 21:34:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:12,862 INFO L225 Difference]: With dead ends: 232 [2019-10-13 21:34:12,863 INFO L226 Difference]: Without dead ends: 167 [2019-10-13 21:34:12,868 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2404 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1508, Invalid=7612, Unknown=0, NotChecked=0, Total=9120 [2019-10-13 21:34:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-13 21:34:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2019-10-13 21:34:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-13 21:34:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2019-10-13 21:34:12,901 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 89 [2019-10-13 21:34:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:12,902 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2019-10-13 21:34:12,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-13 21:34:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2019-10-13 21:34:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 21:34:12,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:12,905 INFO L380 BasicCegarLoop]: trace histogram [23, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:13,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:13,111 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:13,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:13,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1310060960, now seen corresponding path program 6 times [2019-10-13 21:34:13,112 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:13,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390040533] [2019-10-13 21:34:13,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:13,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:13,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-13 21:34:13,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390040533] [2019-10-13 21:34:13,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498918146] [2019-10-13 21:34:13,608 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:34:13,838 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:34:13,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:13,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-13 21:34:13,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-13 21:34:13,908 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-13 21:34:14,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1351392725] [2019-10-13 21:34:14,886 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:34:14,886 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:14,887 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:14,887 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:14,887 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:14,907 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:15,953 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:16,768 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:16,775 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:16,778 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:16,778 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:16,779 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:16,779 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,779 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:16,779 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-13 21:34:16,779 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:16,780 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,780 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* main_~x~0 4) |main_~#a9~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:16,780 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,780 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,780 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,780 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:16,781 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:16,781 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:16,781 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:16,781 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,781 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:16,781 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) [2019-10-13 21:34:16,782 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:16,782 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:16,782 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:17,130 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:17,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 11] total 61 [2019-10-13 21:34:17,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887972520] [2019-10-13 21:34:17,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-13 21:34:17,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:17,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-13 21:34:17,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1304, Invalid=2356, Unknown=0, NotChecked=0, Total=3660 [2019-10-13 21:34:17,135 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 61 states. [2019-10-13 21:34:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:19,824 INFO L93 Difference]: Finished difference Result 321 states and 363 transitions. [2019-10-13 21:34:19,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-13 21:34:19,824 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 154 [2019-10-13 21:34:19,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:19,827 INFO L225 Difference]: With dead ends: 321 [2019-10-13 21:34:19,827 INFO L226 Difference]: Without dead ends: 192 [2019-10-13 21:34:19,832 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2979 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3807, Invalid=9533, Unknown=0, NotChecked=0, Total=13340 [2019-10-13 21:34:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-13 21:34:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 183. [2019-10-13 21:34:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-13 21:34:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 192 transitions. [2019-10-13 21:34:19,851 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 192 transitions. Word has length 154 [2019-10-13 21:34:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:19,851 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 192 transitions. [2019-10-13 21:34:19,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-13 21:34:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 192 transitions. [2019-10-13 21:34:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-13 21:34:19,855 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:19,855 INFO L380 BasicCegarLoop]: trace histogram [48, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:20,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:20,064 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:20,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:20,064 INFO L82 PathProgramCache]: Analyzing trace with hash -201028471, now seen corresponding path program 7 times [2019-10-13 21:34:20,064 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:20,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446636534] [2019-10-13 21:34:20,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:20,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:20,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-13 21:34:21,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446636534] [2019-10-13 21:34:21,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685062330] [2019-10-13 21:34:21,228 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:34:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:21,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-13 21:34:21,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-13 21:34:21,565 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-13 21:34:24,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [491810456] [2019-10-13 21:34:24,164 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:34:24,165 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:24,165 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:24,165 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:24,166 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:24,188 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:24,495 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:34:24,765 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:24,976 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:25,259 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:25,484 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:26,070 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:26,075 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:26,077 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:26,077 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:26,077 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 432#(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_~#a9~0.base_BEFORE_CALL_7| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_7|) |v_main_~#a9~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:26,078 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:26,078 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 437#(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_~#a9~0.base_BEFORE_CALL_7| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_7|) |v_main_~#a9~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:26,078 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 68#true [2019-10-13 21:34:26,078 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 446#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:26,078 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 369#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:26,079 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 422#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem19| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* main_~x~0 4) |main_~#a9~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:26,079 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:26,079 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 412#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:26,079 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:26,079 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:26,079 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:26,080 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 451#(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:26,080 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:26,080 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:26,080 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:26,080 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 427#(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_~#a9~0.base_BEFORE_CALL_7| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_7|) |v_main_~#a9~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) [2019-10-13 21:34:26,080 INFO L193 IcfgInterpreter]: Reachable states at location L44-3 satisfy 417#(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:26,081 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 442#(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_~#a9~0.base_BEFORE_CALL_7| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_7|) |v_main_~#a9~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:26,081 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:26,568 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:26,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51, 11] total 111 [2019-10-13 21:34:26,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896006590] [2019-10-13 21:34:26,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-13 21:34:26,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:26,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-13 21:34:26,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5079, Invalid=7131, Unknown=0, NotChecked=0, Total=12210 [2019-10-13 21:34:26,576 INFO L87 Difference]: Start difference. First operand 183 states and 192 transitions. Second operand 111 states.