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-multidimensional/min-2-u.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:38:09,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:38:09,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:38:09,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:38:09,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:38:09,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:38:09,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:38:09,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:38:09,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:38:09,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:38:09,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:38:09,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:38:09,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:38:09,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:38:09,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:38:09,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:38:09,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:38:09,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:38:09,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:38:09,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:38:09,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:38:09,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:38:09,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:38:09,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:38:09,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:38:09,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:38:09,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:38:09,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:38:09,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:38:09,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:38:09,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:38:09,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:38:09,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:38:09,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:38:09,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:38:09,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:38:09,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:38:09,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:38:09,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:38:09,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:38:09,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:38:09,337 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:38:09,350 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:38:09,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:38:09,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:38:09,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:38:09,352 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:38:09,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:38:09,353 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:38:09,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:38:09,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:38:09,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:38:09,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:38:09,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:38:09,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:38:09,354 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:38:09,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:38:09,354 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:38:09,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:38:09,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:38:09,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:38:09,355 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:38:09,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:38:09,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:38:09,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:38:09,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:38:09,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:38:09,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:38:09,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:38:09,357 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:38:09,357 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:38:09,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:38:09,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:38:09,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:38:09,666 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:38:09,666 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:38:09,667 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/min-2-u.c [2019-10-13 21:38:09,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62237ef62/9b094900e12a4fdc834f32afc66d318f/FLAGb4da65f92 [2019-10-13 21:38:10,189 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:38:10,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/min-2-u.c [2019-10-13 21:38:10,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62237ef62/9b094900e12a4fdc834f32afc66d318f/FLAGb4da65f92 [2019-10-13 21:38:10,570 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62237ef62/9b094900e12a4fdc834f32afc66d318f [2019-10-13 21:38:10,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:38:10,583 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:38:10,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:38:10,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:38:10,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:38:10,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:38:10" (1/1) ... [2019-10-13 21:38:10,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3534b1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:38:10, skipping insertion in model container [2019-10-13 21:38:10,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:38:10" (1/1) ... [2019-10-13 21:38:10,603 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:38:10,623 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:38:10,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:38:10,849 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:38:10,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:38:10,977 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:38:10,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:38:10 WrapperNode [2019-10-13 21:38:10,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:38:10,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:38:10,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:38:10,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:38:10,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:38:10" (1/1) ... [2019-10-13 21:38:10,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:38:10" (1/1) ... [2019-10-13 21:38:11,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:38:10" (1/1) ... [2019-10-13 21:38:11,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:38:10" (1/1) ... [2019-10-13 21:38:11,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:38:10" (1/1) ... [2019-10-13 21:38:11,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:38:10" (1/1) ... [2019-10-13 21:38:11,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:38:10" (1/1) ... [2019-10-13 21:38:11,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:38:11,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:38:11,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:38:11,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:38:11,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:38:10" (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:38:11,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:38:11,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:38:11,098 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:38:11,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:38:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:38:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:38:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:38:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:38:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:38:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:38:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:38:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:38:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:38:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:38:11,489 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:38:11,490 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-13 21:38:11,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:38:11 BoogieIcfgContainer [2019-10-13 21:38:11,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:38:11,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:38:11,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:38:11,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:38:11,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:38:10" (1/3) ... [2019-10-13 21:38:11,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423b95e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:38:11, skipping insertion in model container [2019-10-13 21:38:11,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:38:10" (2/3) ... [2019-10-13 21:38:11,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423b95e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:38:11, skipping insertion in model container [2019-10-13 21:38:11,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:38:11" (3/3) ... [2019-10-13 21:38:11,502 INFO L109 eAbstractionObserver]: Analyzing ICFG min-2-u.c [2019-10-13 21:38:11,512 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:38:11,520 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:38:11,531 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:38:11,555 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:38:11,555 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:38:11,556 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:38:11,556 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:38:11,556 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:38:11,556 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:38:11,556 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:38:11,556 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:38:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-13 21:38:11,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:38:11,575 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:38:11,576 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:38:11,578 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:38:11,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:38:11,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1121179117, now seen corresponding path program 1 times [2019-10-13 21:38:11,590 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:38:11,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483938413] [2019-10-13 21:38:11,591 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:11,591 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:11,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:38:11,670 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:38:11,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410044521] [2019-10-13 21:38:11,671 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:38:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:38:11,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:38:11,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:38:11,826 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:38:11,827 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:38:11,867 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:38:11,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483938413] [2019-10-13 21:38:11,872 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:38:11,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410044521] [2019-10-13 21:38:11,873 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:38:11,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-13 21:38:11,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317534913] [2019-10-13 21:38:11,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:38:11,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:38:11,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:38:11,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:38:11,901 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 4 states. [2019-10-13 21:38:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:38:11,991 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2019-10-13 21:38:11,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:38:11,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-13 21:38:11,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:38:12,010 INFO L225 Difference]: With dead ends: 40 [2019-10-13 21:38:12,010 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 21:38:12,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:38:12,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 21:38:12,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 21:38:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:38:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-10-13 21:38:12,060 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2019-10-13 21:38:12,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:38:12,062 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-10-13 21:38:12,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:38:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-10-13 21:38:12,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:38:12,064 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:38:12,064 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:38:12,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:38:12,269 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:38:12,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:38:12,271 INFO L82 PathProgramCache]: Analyzing trace with hash 343234267, now seen corresponding path program 1 times [2019-10-13 21:38:12,271 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:38:12,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925924795] [2019-10-13 21:38:12,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:12,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:12,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:38:12,283 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:38:12,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1890440715] [2019-10-13 21:38:12,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:38:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:38:12,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:38:12,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:38:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:38:12,370 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:38:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:38:12,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925924795] [2019-10-13 21:38:12,400 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:38:12,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890440715] [2019-10-13 21:38:12,401 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:38:12,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-13 21:38:12,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412161460] [2019-10-13 21:38:12,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:38:12,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:38:12,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:38:12,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:38:12,406 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 6 states. [2019-10-13 21:38:12,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:38:12,567 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2019-10-13 21:38:12,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:38:12,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-13 21:38:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:38:12,573 INFO L225 Difference]: With dead ends: 49 [2019-10-13 21:38:12,573 INFO L226 Difference]: Without dead ends: 34 [2019-10-13 21:38:12,575 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:38:12,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-13 21:38:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-13 21:38:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:38:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-10-13 21:38:12,603 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 17 [2019-10-13 21:38:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:38:12,603 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-10-13 21:38:12,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:38:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-10-13 21:38:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:38:12,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:38:12,605 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:38:12,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:38:12,809 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:38:12,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:38:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1084120933, now seen corresponding path program 1 times [2019-10-13 21:38:12,811 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:38:12,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130224770] [2019-10-13 21:38:12,812 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:12,812 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:12,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:38:12,822 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:38:12,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878799055] [2019-10-13 21:38:12,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:38:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:38:12,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:38:12,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:38:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:38:12,948 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:38:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:38:13,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130224770] [2019-10-13 21:38:13,008 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:38:13,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878799055] [2019-10-13 21:38:13,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1114001413] [2019-10-13 21:38:13,066 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:38:13,066 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:38:13,075 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:38:13,083 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:38:13,084 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:38:13,280 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:38:13,862 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 1 for LOIs [2019-10-13 21:38:13,872 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:38:13,880 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:38:13,881 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:38:13,881 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 195#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:38:13,881 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 172#(<= 0 main_~j~0) [2019-10-13 21:38:13,882 INFO L193 IcfgInterpreter]: Reachable states at location L36-2 satisfy 118#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:13,882 INFO L193 IcfgInterpreter]: Reachable states at location L56 satisfy 133#(and (<= main_~n~0 0) (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~j~0 4) (* main_~i~0 (* main_~n~0 4)) |main_~#A~0.offset|)) |main_#t~mem4|) (< main_~j~0 main_~n~0) (< main_~i~0 main_~n~0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:13,883 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 181#false [2019-10-13 21:38:13,883 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:38:13,884 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:38:13,884 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 200#(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:38:13,885 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:38:13,885 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 191#false [2019-10-13 21:38:13,886 INFO L193 IcfgInterpreter]: Reachable states at location L52-2 satisfy 123#(and (<= main_~n~0 0) (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:13,886 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 186#false [2019-10-13 21:38:13,887 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 176#false [2019-10-13 21:38:13,891 INFO L193 IcfgInterpreter]: Reachable states at location L54-2 satisfy 128#(and (<= main_~n~0 0) (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (< main_~i~0 main_~n~0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:13,892 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 113#(or (and (= main_~n~0 1500) (= (select |old(#valid)| |main_~#A~0.base|) 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (not (= 0 |main_~#A~0.base|)) (= |#length| (store |old(#length)| |main_~#A~0.base| (* (* main_~n~0 4) main_~n~0))) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| |main_~#A~0.base| 1)) (= main_~j~0 0) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= main_~m~0 1000) (= |#NULL.offset| 0) (= main_~i~0 0)) (not (< main_~j~0 main_~n~0))) [2019-10-13 21:38:14,150 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-10-13 21:38:14,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:38:14,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 6] total 18 [2019-10-13 21:38:14,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799226903] [2019-10-13 21:38:14,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:38:14,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:38:14,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:38:14,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:38:14,244 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 10 states. [2019-10-13 21:38:14,444 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-13 21:38:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:38:14,663 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2019-10-13 21:38:14,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:38:14,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-10-13 21:38:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:38:14,665 INFO L225 Difference]: With dead ends: 50 [2019-10-13 21:38:14,665 INFO L226 Difference]: Without dead ends: 35 [2019-10-13 21:38:14,666 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:38:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-13 21:38:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-10-13 21:38:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 21:38:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-10-13 21:38:14,675 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 21 [2019-10-13 21:38:14,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:38:14,675 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-10-13 21:38:14,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:38:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-10-13 21:38:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:38:14,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:38:14,678 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:38:14,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:38:14,882 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:38:14,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:38:14,882 INFO L82 PathProgramCache]: Analyzing trace with hash 207754054, now seen corresponding path program 1 times [2019-10-13 21:38:14,883 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:38:14,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81748715] [2019-10-13 21:38:14,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:14,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:14,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:38:14,892 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:38:14,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1933185410] [2019-10-13 21:38:14,892 INFO L94 rtionOrderModulation]: Keeping assertion order 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:38:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:38:14,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:38:14,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:38:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:38:14,989 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:38:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:38:15,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81748715] [2019-10-13 21:38:15,027 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:38:15,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933185410] [2019-10-13 21:38:15,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1988559724] [2019-10-13 21:38:15,029 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:38:15,029 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:38:15,030 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:38:15,030 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:38:15,030 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:38:15,057 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:38:15,572 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:38:15,589 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:38:15,593 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:38:15,594 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:38:15,594 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 308#(<= 0 main_~j~0) [2019-10-13 21:38:15,594 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 331#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:38:15,595 INFO L193 IcfgInterpreter]: Reachable states at location L36-2 satisfy 249#(or (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 1 main_~i~0) (not (< main_~j~0 main_~n~0))) (and (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0))) [2019-10-13 21:38:15,595 INFO L193 IcfgInterpreter]: Reachable states at location L56 satisfy 270#(and (<= 0 main_~n~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~j~0 4) (* main_~i~0 (* main_~n~0 4)) |main_~#A~0.offset|)) |main_#t~mem4|) (< main_~j~0 main_~n~0) (< main_~i~0 main_~n~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:15,595 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 317#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:38:15,596 INFO L193 IcfgInterpreter]: Reachable states at location L38-2 satisfy 244#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0)) [2019-10-13 21:38:15,596 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:38:15,596 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:38:15,596 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 336#(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:38:15,597 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:38:15,597 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 327#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:38:15,597 INFO L193 IcfgInterpreter]: Reachable states at location L52-2 satisfy 254#(and (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= main_~i~0 0) (<= main_~j~0 0)) (or (and (<= main_~n~0 0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (= main_~i~0 0)) (and (<= 0 main_~n~0) (= main_~j~0 0) (= main_~i~0 0)))) [2019-10-13 21:38:15,597 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 322#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:38:15,598 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 312#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:38:15,598 INFO L193 IcfgInterpreter]: Reachable states at location L54-2 satisfy 259#(and (<= 0 main_~n~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< main_~i~0 main_~n~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:15,598 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 113#(or (and (= main_~n~0 1500) (= (select |old(#valid)| |main_~#A~0.base|) 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (not (= 0 |main_~#A~0.base|)) (= |#length| (store |old(#length)| |main_~#A~0.base| (* (* main_~n~0 4) main_~n~0))) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| |main_~#A~0.base| 1)) (= main_~j~0 0) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= main_~m~0 1000) (= |#NULL.offset| 0) (= main_~i~0 0)) (not (< main_~j~0 main_~n~0))) [2019-10-13 21:38:16,247 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:38:16,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 14] total 24 [2019-10-13 21:38:16,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844954469] [2019-10-13 21:38:16,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-13 21:38:16,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:38:16,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-13 21:38:16,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:38:16,250 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 24 states. [2019-10-13 21:38:16,921 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-10-13 21:38:17,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:38:17,591 INFO L93 Difference]: Finished difference Result 86 states and 120 transitions. [2019-10-13 21:38:17,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 21:38:17,592 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2019-10-13 21:38:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:38:17,593 INFO L225 Difference]: With dead ends: 86 [2019-10-13 21:38:17,593 INFO L226 Difference]: Without dead ends: 62 [2019-10-13 21:38:17,595 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=316, Invalid=1244, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 21:38:17,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-13 21:38:17,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2019-10-13 21:38:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-13 21:38:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2019-10-13 21:38:17,613 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 25 [2019-10-13 21:38:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:38:17,614 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2019-10-13 21:38:17,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-13 21:38:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2019-10-13 21:38:17,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 21:38:17,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:38:17,616 INFO L380 BasicCegarLoop]: trace histogram [12, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:38:17,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:38:17,820 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:38:17,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:38:17,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1166771462, now seen corresponding path program 2 times [2019-10-13 21:38:17,822 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:38:17,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702707327] [2019-10-13 21:38:17,822 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:17,822 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:17,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:38:17,833 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:38:17,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [416129498] [2019-10-13 21:38:17,833 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:38:17,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:38:17,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:38:17,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:38:17,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:38:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-13 21:38:17,937 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:38:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-13 21:38:17,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702707327] [2019-10-13 21:38:17,965 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:38:17,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416129498] [2019-10-13 21:38:17,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [966157316] [2019-10-13 21:38:17,967 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:38:17,969 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:38:17,970 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:38:17,970 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:38:17,970 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:38:18,012 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:38:18,390 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:38:18,411 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:38:18,415 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:38:18,415 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:38:18,415 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 308#(<= 0 main_~j~0) [2019-10-13 21:38:18,415 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 331#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:38:18,416 INFO L193 IcfgInterpreter]: Reachable states at location L36-2 satisfy 249#(or (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 1 main_~i~0) (not (< main_~j~0 main_~n~0))) (and (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0))) [2019-10-13 21:38:18,416 INFO L193 IcfgInterpreter]: Reachable states at location L56 satisfy 270#(and (<= 0 main_~n~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~j~0 4) (* main_~i~0 (* main_~n~0 4)) |main_~#A~0.offset|)) |main_#t~mem4|) (< main_~j~0 main_~n~0) (< main_~i~0 main_~n~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:18,416 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 317#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:38:18,416 INFO L193 IcfgInterpreter]: Reachable states at location L38-2 satisfy 244#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0)) [2019-10-13 21:38:18,417 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:38:18,418 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:38:18,418 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 336#(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:38:18,418 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:38:18,420 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 327#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:38:18,420 INFO L193 IcfgInterpreter]: Reachable states at location L52-2 satisfy 254#(and (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= main_~i~0 0) (<= main_~j~0 0)) (or (and (<= main_~n~0 0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (= main_~i~0 0)) (and (<= 0 main_~n~0) (= main_~j~0 0) (= main_~i~0 0)))) [2019-10-13 21:38:18,420 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 322#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:38:18,420 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 312#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:38:18,421 INFO L193 IcfgInterpreter]: Reachable states at location L54-2 satisfy 259#(and (<= 0 main_~n~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< main_~i~0 main_~n~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:18,421 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 113#(or (and (= main_~n~0 1500) (= (select |old(#valid)| |main_~#A~0.base|) 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (not (= 0 |main_~#A~0.base|)) (= |#length| (store |old(#length)| |main_~#A~0.base| (* (* main_~n~0 4) main_~n~0))) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| |main_~#A~0.base| 1)) (= main_~j~0 0) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= main_~m~0 1000) (= |#NULL.offset| 0) (= main_~i~0 0)) (not (< main_~j~0 main_~n~0))) [2019-10-13 21:38:18,962 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:38:18,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 14] total 22 [2019-10-13 21:38:18,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516391245] [2019-10-13 21:38:18,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 21:38:18,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:38:18,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 21:38:18,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-10-13 21:38:18,965 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 22 states. [2019-10-13 21:38:19,370 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-10-13 21:38:19,618 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-10-13 21:38:19,955 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-10-13 21:38:20,193 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-10-13 21:38:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:38:20,782 INFO L93 Difference]: Finished difference Result 191 states and 240 transitions. [2019-10-13 21:38:20,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 21:38:20,782 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-10-13 21:38:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:38:20,785 INFO L225 Difference]: With dead ends: 191 [2019-10-13 21:38:20,786 INFO L226 Difference]: Without dead ends: 165 [2019-10-13 21:38:20,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 21:38:20,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-13 21:38:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 81. [2019-10-13 21:38:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-13 21:38:20,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2019-10-13 21:38:20,809 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 37 [2019-10-13 21:38:20,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:38:20,809 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2019-10-13 21:38:20,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 21:38:20,809 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2019-10-13 21:38:20,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 21:38:20,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:38:20,811 INFO L380 BasicCegarLoop]: trace histogram [24, 12, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:38:21,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:38:21,023 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:38:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:38:21,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1713703481, now seen corresponding path program 3 times [2019-10-13 21:38:21,023 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:38:21,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434239084] [2019-10-13 21:38:21,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:21,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:21,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:38:21,040 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:38:21,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124288719] [2019-10-13 21:38:21,044 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:38:21,159 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:38:21,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:38:21,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-13 21:38:21,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:38:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 15 proven. 310 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-10-13 21:38:21,324 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:38:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 15 proven. 310 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-10-13 21:38:21,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434239084] [2019-10-13 21:38:21,532 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:38:21,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124288719] [2019-10-13 21:38:21,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [780386940] [2019-10-13 21:38:21,535 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:38:21,535 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:38:21,536 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:38:21,539 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:38:21,539 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:38:21,561 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:38:21,815 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:38:21,823 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:38:21,826 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:38:21,827 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:38:21,827 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 308#(<= 0 main_~j~0) [2019-10-13 21:38:21,827 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 331#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:38:21,827 INFO L193 IcfgInterpreter]: Reachable states at location L36-2 satisfy 249#(or (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 1 main_~i~0) (not (< main_~j~0 main_~n~0))) (and (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0))) [2019-10-13 21:38:21,827 INFO L193 IcfgInterpreter]: Reachable states at location L56 satisfy 270#(and (<= 0 main_~n~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~j~0 4) (* main_~i~0 (* main_~n~0 4)) |main_~#A~0.offset|)) |main_#t~mem4|) (< main_~j~0 main_~n~0) (< main_~i~0 main_~n~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:21,828 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 317#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:38:21,828 INFO L193 IcfgInterpreter]: Reachable states at location L38-2 satisfy 244#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0)) [2019-10-13 21:38:21,828 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:38:21,828 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:38:21,828 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 336#(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:38:21,828 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:38:21,829 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 327#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:38:21,829 INFO L193 IcfgInterpreter]: Reachable states at location L52-2 satisfy 254#(and (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= main_~i~0 0) (<= main_~j~0 0)) (or (and (<= main_~n~0 0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (= main_~i~0 0)) (and (<= 0 main_~n~0) (= main_~j~0 0) (= main_~i~0 0)))) [2019-10-13 21:38:21,829 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 322#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:38:21,829 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 312#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:38:21,829 INFO L193 IcfgInterpreter]: Reachable states at location L54-2 satisfy 259#(and (<= 0 main_~n~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< main_~i~0 main_~n~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:21,830 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 113#(or (and (= main_~n~0 1500) (= (select |old(#valid)| |main_~#A~0.base|) 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (not (= 0 |main_~#A~0.base|)) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#length| (store |old(#length)| |main_~#A~0.base| (* (* main_~n~0 4) main_~n~0))) (= |#valid| (store |old(#valid)| |main_~#A~0.base| 1)) (= main_~j~0 0) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= main_~m~0 1000) (= |#NULL.offset| 0) (= main_~i~0 0)) (not (< main_~j~0 main_~n~0))) [2019-10-13 21:38:22,458 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:38:22,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2019-10-13 21:38:22,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618556834] [2019-10-13 21:38:22,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-13 21:38:22,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:38:22,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-13 21:38:22,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1333, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 21:38:22,461 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand 40 states. [2019-10-13 21:38:25,899 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-10-13 21:38:26,324 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-10-13 21:38:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:38:27,767 INFO L93 Difference]: Finished difference Result 391 states and 496 transitions. [2019-10-13 21:38:27,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-13 21:38:27,768 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 61 [2019-10-13 21:38:27,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:38:27,774 INFO L225 Difference]: With dead ends: 391 [2019-10-13 21:38:27,774 INFO L226 Difference]: Without dead ends: 365 [2019-10-13 21:38:27,777 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3148 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1724, Invalid=7978, Unknown=0, NotChecked=0, Total=9702 [2019-10-13 21:38:27,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-10-13 21:38:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 106. [2019-10-13 21:38:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-13 21:38:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2019-10-13 21:38:27,812 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 61 [2019-10-13 21:38:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:38:27,812 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2019-10-13 21:38:27,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-13 21:38:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2019-10-13 21:38:27,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 21:38:27,814 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:38:27,814 INFO L380 BasicCegarLoop]: trace histogram [36, 12, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:38:28,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:38:28,019 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:38:28,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:38:28,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1482595171, now seen corresponding path program 4 times [2019-10-13 21:38:28,020 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:38:28,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832341983] [2019-10-13 21:38:28,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:28,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:28,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:38:28,028 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:38:28,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113210464] [2019-10-13 21:38:28,029 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:38:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:38:28,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 21:38:28,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:38:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-10-13 21:38:28,261 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:38:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-10-13 21:38:28,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832341983] [2019-10-13 21:38:28,351 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:38:28,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113210464] [2019-10-13 21:38:28,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [501030287] [2019-10-13 21:38:28,352 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:38:28,353 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:38:28,353 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:38:28,353 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:38:28,353 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:38:28,377 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:38:28,647 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:38:28,656 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:38:28,659 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:38:28,660 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:38:28,660 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 280#(<= 0 main_~j~0) [2019-10-13 21:38:28,660 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 303#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:38:28,660 INFO L193 IcfgInterpreter]: Reachable states at location L36-2 satisfy 221#(or (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 1 main_~i~0) (not (< main_~j~0 main_~n~0))) (and (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0))) [2019-10-13 21:38:28,660 INFO L193 IcfgInterpreter]: Reachable states at location L56 satisfy 242#(and (<= 0 main_~n~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~j~0 4) (* main_~i~0 (* main_~n~0 4)) |main_~#A~0.offset|)) |main_#t~mem4|) (< main_~j~0 main_~n~0) (< main_~i~0 main_~n~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:28,660 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 289#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:38:28,661 INFO L193 IcfgInterpreter]: Reachable states at location L38-2 satisfy 216#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0)) [2019-10-13 21:38:28,661 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:38:28,661 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:38:28,661 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 308#(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:38:28,661 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:38:28,662 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 299#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:38:28,662 INFO L193 IcfgInterpreter]: Reachable states at location L52-2 satisfy 226#(and (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= main_~i~0 0) (<= main_~j~0 0)) (or (and (<= main_~n~0 0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (= main_~i~0 0)) (and (<= 0 main_~n~0) (= main_~j~0 0) (= main_~i~0 0)))) [2019-10-13 21:38:28,662 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 294#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:38:28,662 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 284#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:38:28,662 INFO L193 IcfgInterpreter]: Reachable states at location L54-2 satisfy 231#(and (<= 0 main_~n~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< main_~i~0 main_~n~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:28,663 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 113#(or (and (= main_~n~0 1500) (= (select |old(#valid)| |main_~#A~0.base|) 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (not (= 0 |main_~#A~0.base|)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#length| (store |old(#length)| |main_~#A~0.base| (* (* main_~n~0 4) main_~n~0))) (= |#valid| (store |old(#valid)| |main_~#A~0.base| 1)) (= main_~j~0 0) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= main_~m~0 1000) (= |#NULL.offset| 0) (= main_~i~0 0)) (not (< main_~j~0 main_~n~0))) [2019-10-13 21:38:29,144 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:38:29,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 14] total 32 [2019-10-13 21:38:29,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69657181] [2019-10-13 21:38:29,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-13 21:38:29,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:38:29,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-13 21:38:29,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:38:29,148 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 32 states. [2019-10-13 21:38:30,234 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-10-13 21:38:31,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:38:31,212 INFO L93 Difference]: Finished difference Result 298 states and 421 transitions. [2019-10-13 21:38:31,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-13 21:38:31,213 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 77 [2019-10-13 21:38:31,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:38:31,215 INFO L225 Difference]: With dead ends: 298 [2019-10-13 21:38:31,215 INFO L226 Difference]: Without dead ends: 205 [2019-10-13 21:38:31,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=704, Invalid=2376, Unknown=0, NotChecked=0, Total=3080 [2019-10-13 21:38:31,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-13 21:38:31,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2019-10-13 21:38:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-13 21:38:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 226 transitions. [2019-10-13 21:38:31,258 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 226 transitions. Word has length 77 [2019-10-13 21:38:31,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:38:31,258 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 226 transitions. [2019-10-13 21:38:31,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-13 21:38:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 226 transitions. [2019-10-13 21:38:31,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:38:31,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:38:31,261 INFO L380 BasicCegarLoop]: trace histogram [98, 28, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:38:31,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:38:31,465 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:38:31,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:38:31,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2101373704, now seen corresponding path program 5 times [2019-10-13 21:38:31,466 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:38:31,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099641940] [2019-10-13 21:38:31,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:31,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:31,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:38:31,478 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:38:31,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769592262] [2019-10-13 21:38:31,478 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:38:37,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-10-13 21:38:37,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:38:37,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-13 21:38:37,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:38:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5926 backedges. 227 proven. 105 refuted. 0 times theorem prover too weak. 5594 trivial. 0 not checked. [2019-10-13 21:38:37,683 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:38:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5926 backedges. 2 proven. 330 refuted. 0 times theorem prover too weak. 5594 trivial. 0 not checked. [2019-10-13 21:38:37,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099641940] [2019-10-13 21:38:37,957 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:38:37,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769592262] [2019-10-13 21:38:37,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1288973292] [2019-10-13 21:38:37,959 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:38:37,959 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:38:37,960 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:38:37,960 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:38:37,960 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:38:37,978 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:38:38,323 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:38:38,335 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:38:38,339 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:38:38,339 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:38:38,340 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 280#(<= 0 main_~j~0) [2019-10-13 21:38:38,340 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 303#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:38:38,340 INFO L193 IcfgInterpreter]: Reachable states at location L36-2 satisfy 221#(or (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 1 main_~i~0) (not (< main_~j~0 main_~n~0))) (and (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0))) [2019-10-13 21:38:38,340 INFO L193 IcfgInterpreter]: Reachable states at location L56 satisfy 242#(and (<= 0 main_~n~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~j~0 4) (* main_~i~0 (* main_~n~0 4)) |main_~#A~0.offset|)) |main_#t~mem4|) (< main_~j~0 main_~n~0) (< main_~i~0 main_~n~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:38,341 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 289#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:38:38,341 INFO L193 IcfgInterpreter]: Reachable states at location L38-2 satisfy 216#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0)) [2019-10-13 21:38:38,341 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:38:38,342 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:38:38,342 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 308#(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:38:38,342 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 299#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:38:38,343 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:38:38,343 INFO L193 IcfgInterpreter]: Reachable states at location L52-2 satisfy 226#(and (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= main_~i~0 0) (<= main_~j~0 0)) (or (and (<= main_~n~0 0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (= main_~i~0 0)) (and (<= 0 main_~n~0) (= main_~j~0 0) (= main_~i~0 0)))) [2019-10-13 21:38:38,343 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 294#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:38:38,344 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 284#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:38:38,344 INFO L193 IcfgInterpreter]: Reachable states at location L54-2 satisfy 231#(and (<= 0 main_~n~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< main_~i~0 main_~n~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:38,344 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 113#(or (and (= main_~n~0 1500) (= (select |old(#valid)| |main_~#A~0.base|) 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (not (= 0 |main_~#A~0.base|)) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#length| (store |old(#length)| |main_~#A~0.base| (* (* main_~n~0 4) main_~n~0))) (= |#valid| (store |old(#valid)| |main_~#A~0.base| 1)) (= main_~j~0 0) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= main_~m~0 1000) (= |#NULL.offset| 0) (= main_~i~0 0)) (not (< main_~j~0 main_~n~0))) [2019-10-13 21:38:38,646 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-10-13 21:38:39,030 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:38:39,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 14] total 48 [2019-10-13 21:38:39,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919890667] [2019-10-13 21:38:39,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-13 21:38:39,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:38:39,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-13 21:38:39,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=1679, Unknown=0, NotChecked=0, Total=2256 [2019-10-13 21:38:39,034 INFO L87 Difference]: Start difference. First operand 201 states and 226 transitions. Second operand 48 states. [2019-10-13 21:38:41,293 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-10-13 21:38:43,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:38:43,256 INFO L93 Difference]: Finished difference Result 577 states and 803 transitions. [2019-10-13 21:38:43,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-13 21:38:43,257 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 157 [2019-10-13 21:38:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:38:43,260 INFO L225 Difference]: With dead ends: 577 [2019-10-13 21:38:43,261 INFO L226 Difference]: Without dead ends: 397 [2019-10-13 21:38:43,264 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2280 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2056, Invalid=5600, Unknown=0, NotChecked=0, Total=7656 [2019-10-13 21:38:43,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-10-13 21:38:43,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 393. [2019-10-13 21:38:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-10-13 21:38:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 434 transitions. [2019-10-13 21:38:43,312 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 434 transitions. Word has length 157 [2019-10-13 21:38:43,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:38:43,313 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 434 transitions. [2019-10-13 21:38:43,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-13 21:38:43,313 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 434 transitions. [2019-10-13 21:38:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-13 21:38:43,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:38:43,319 INFO L380 BasicCegarLoop]: trace histogram [210, 60, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:38:43,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:38:43,528 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:38:43,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:38:43,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1260267000, now seen corresponding path program 6 times [2019-10-13 21:38:43,531 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:38:43,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949246514] [2019-10-13 21:38:43,531 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:43,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:38:43,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:38:43,549 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:38:43,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1036382741] [2019-10-13 21:38:43,549 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:38:43,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:38:43,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:38:43,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-13 21:38:43,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:38:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 25358 backedges. 435 proven. 20239 refuted. 0 times theorem prover too weak. 4684 trivial. 0 not checked. [2019-10-13 21:38:44,780 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:38:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 25358 backedges. 435 proven. 20239 refuted. 0 times theorem prover too weak. 4684 trivial. 0 not checked. [2019-10-13 21:38:45,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949246514] [2019-10-13 21:38:45,759 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:38:45,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036382741] [2019-10-13 21:38:45,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [353194475] [2019-10-13 21:38:45,761 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:38:45,762 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:38:45,762 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:38:45,762 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:38:45,762 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:38:45,780 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:38:46,044 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:38:46,052 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:38:46,055 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:38:46,055 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:38:46,056 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 308#(<= 0 main_~j~0) [2019-10-13 21:38:46,056 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 331#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:38:46,056 INFO L193 IcfgInterpreter]: Reachable states at location L36-2 satisfy 249#(or (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 1 main_~i~0) (not (< main_~j~0 main_~n~0))) (and (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0))) [2019-10-13 21:38:46,056 INFO L193 IcfgInterpreter]: Reachable states at location L56 satisfy 270#(and (<= 0 main_~n~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~j~0 4) (* main_~i~0 (* main_~n~0 4)) |main_~#A~0.offset|)) |main_#t~mem4|) (< main_~j~0 main_~n~0) (< main_~i~0 main_~n~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:46,056 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 317#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:38:46,056 INFO L193 IcfgInterpreter]: Reachable states at location L38-2 satisfy 244#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0)) [2019-10-13 21:38:46,056 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:38:46,057 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:38:46,057 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 336#(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:38:46,057 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 327#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:38:46,057 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:38:46,057 INFO L193 IcfgInterpreter]: Reachable states at location L52-2 satisfy 254#(and (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= main_~i~0 0) (<= main_~j~0 0)) (or (and (<= main_~n~0 0) (= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= main_~j~0 0) (= main_~i~0 0)) (and (<= 0 main_~n~0) (= main_~j~0 0) (= main_~i~0 0)))) [2019-10-13 21:38:46,058 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 322#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:38:46,058 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 312#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:38:46,058 INFO L193 IcfgInterpreter]: Reachable states at location L54-2 satisfy 259#(and (<= 0 main_~n~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< main_~i~0 main_~n~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:38:46,058 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 113#(or (and (= main_~n~0 1500) (= (select |old(#valid)| |main_~#A~0.base|) 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (not (= 0 |main_~#A~0.base|)) (= |#length| (store |old(#length)| |main_~#A~0.base| (* (* main_~n~0 4) main_~n~0))) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| |main_~#A~0.base| 1)) (= main_~j~0 0) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= main_~m~0 1000) (= |#NULL.offset| 0) (= main_~i~0 0)) (not (< main_~j~0 main_~n~0))) [2019-10-13 21:38:47,063 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:38:47,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 14] total 94 [2019-10-13 21:38:47,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175199501] [2019-10-13 21:38:47,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-10-13 21:38:47,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:38:47,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-10-13 21:38:47,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2243, Invalid=6499, Unknown=0, NotChecked=0, Total=8742 [2019-10-13 21:38:47,068 INFO L87 Difference]: Start difference. First operand 393 states and 434 transitions. Second operand 94 states.