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/loops/insertion_sort-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:03:35,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:03:35,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:03:35,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:03:35,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:03:35,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:03:35,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:03:36,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:03:36,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:03:36,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:03:36,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:03:36,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:03:36,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:03:36,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:03:36,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:03:36,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:03:36,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:03:36,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:03:36,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:03:36,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:03:36,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:03:36,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:03:36,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:03:36,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:03:36,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:03:36,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:03:36,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:03:36,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:03:36,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:03:36,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:03:36,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:03:36,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:03:36,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:03:36,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:03:36,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:03:36,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:03:36,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:03:36,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:03:36,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:03:36,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:03:36,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:03:36,056 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-15 03:03:36,091 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:03:36,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:03:36,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:03:36,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:03:36,093 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:03:36,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:03:36,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:03:36,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:03:36,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:03:36,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:03:36,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:03:36,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:03:36,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:03:36,095 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:03:36,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:03:36,095 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:03:36,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:03:36,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:03:36,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:03:36,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:03:36,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:03:36,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:03:36,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:03:36,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:03:36,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:03:36,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:03:36,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:03:36,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:03:36,098 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-15 03:03:36,411 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:03:36,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:03:36,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:03:36,437 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:03:36,438 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:03:36,438 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-2.c [2019-10-15 03:03:36,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61a87dcc4/172faad3ce854dd39cef3c574645db36/FLAG613d8826d [2019-10-15 03:03:37,088 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:03:37,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-2.c [2019-10-15 03:03:37,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61a87dcc4/172faad3ce854dd39cef3c574645db36/FLAG613d8826d [2019-10-15 03:03:37,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61a87dcc4/172faad3ce854dd39cef3c574645db36 [2019-10-15 03:03:37,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:03:37,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:03:37,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:03:37,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:03:37,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:03:37,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:03:37" (1/1) ... [2019-10-15 03:03:37,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e653802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:37, skipping insertion in model container [2019-10-15 03:03:37,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:03:37" (1/1) ... [2019-10-15 03:03:37,429 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:03:37,448 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:03:37,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:03:37,657 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:03:37,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:03:37,704 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:03:37,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:37 WrapperNode [2019-10-15 03:03:37,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:03:37,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:03:37,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:03:37,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:03:37,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:37" (1/1) ... [2019-10-15 03:03:37,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:37" (1/1) ... [2019-10-15 03:03:37,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:37" (1/1) ... [2019-10-15 03:03:37,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:37" (1/1) ... [2019-10-15 03:03:37,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:37" (1/1) ... [2019-10-15 03:03:37,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:37" (1/1) ... [2019-10-15 03:03:37,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:37" (1/1) ... [2019-10-15 03:03:37,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:03:37,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:03:37,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:03:37,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:03:37,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:37" (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-15 03:03:37,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:03:37,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:03:37,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 03:03:37,895 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:03:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:03:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 03:03:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-15 03:03:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:03:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 03:03:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 03:03:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 03:03:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 03:03:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:03:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:03:38,305 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:03:38,305 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-15 03:03:38,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:03:38 BoogieIcfgContainer [2019-10-15 03:03:38,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:03:38,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:03:38,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:03:38,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:03:38,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:03:37" (1/3) ... [2019-10-15 03:03:38,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2aa2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:03:38, skipping insertion in model container [2019-10-15 03:03:38,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:37" (2/3) ... [2019-10-15 03:03:38,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2aa2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:03:38, skipping insertion in model container [2019-10-15 03:03:38,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:03:38" (3/3) ... [2019-10-15 03:03:38,315 INFO L109 eAbstractionObserver]: Analyzing ICFG insertion_sort-2.c [2019-10-15 03:03:38,328 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:03:38,341 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:03:38,351 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:03:38,373 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:03:38,374 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:03:38,374 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:03:38,374 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:03:38,375 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:03:38,375 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:03:38,375 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:03:38,375 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:03:38,394 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-15 03:03:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 03:03:38,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:38,402 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:38,404 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:38,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:38,410 INFO L82 PathProgramCache]: Analyzing trace with hash 369057583, now seen corresponding path program 1 times [2019-10-15 03:03:38,419 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:38,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834774441] [2019-10-15 03:03:38,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:38,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:38,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:38,774 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-15 03:03:38,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834774441] [2019-10-15 03:03:38,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:03:38,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:03:38,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832181962] [2019-10-15 03:03:38,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:03:38,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:38,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:03:38,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:03:38,803 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 4 states. [2019-10-15 03:03:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:38,961 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-10-15 03:03:38,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:03:38,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 03:03:38,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:38,979 INFO L225 Difference]: With dead ends: 43 [2019-10-15 03:03:38,979 INFO L226 Difference]: Without dead ends: 22 [2019-10-15 03:03:38,991 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:03:39,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-15 03:03:39,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2019-10-15 03:03:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-15 03:03:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-15 03:03:39,052 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2019-10-15 03:03:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:39,053 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-15 03:03:39,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:03:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-15 03:03:39,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 03:03:39,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:39,055 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:39,055 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:39,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:39,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2062416228, now seen corresponding path program 1 times [2019-10-15 03:03:39,058 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:39,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489891374] [2019-10-15 03:03:39,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:39,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:39,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:39,899 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2019-10-15 03:03:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:39,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489891374] [2019-10-15 03:03:39,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102860455] [2019-10-15 03:03:39,955 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-15 03:03:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:40,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-15 03:03:40,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:40,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:03:40,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-10-15 03:03:40,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 03:03:40,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 03:03:40,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 03:03:40,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-10-15 03:03:40,533 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 03:03:40,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-10-15 03:03:40,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 03:03:40,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 03:03:40,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 03:03:40,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-15 03:03:40,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:40,594 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:40,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2019-10-15 03:03:40,765 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:03:40,768 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:03:40,775 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:03:40,780 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:03:40,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 03:03:40,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 63 [2019-10-15 03:03:40,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,839 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-15 03:03:40,852 INFO L567 ElimStorePlain]: treesize reduction 40, result has 23.1 percent of original size [2019-10-15 03:03:40,853 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-15 03:03:40,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2019-10-15 03:03:40,870 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:03:40,872 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:03:40,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:03:40,891 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:03:40,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2019-10-15 03:03:40,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:03:40,896 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 03:03:40,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 03:03:40,900 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-15 03:03:40,911 INFO L567 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2019-10-15 03:03:40,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 03:03:40,912 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:7 [2019-10-15 03:03:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:40,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [138803096] [2019-10-15 03:03:40,987 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-15 03:03:40,987 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:40,994 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:41,003 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:41,003 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:41,118 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:03:41,772 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-15 03:03:41,784 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:03:41,790 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:42,959 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:42,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 33 [2019-10-15 03:03:42,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652495054] [2019-10-15 03:03:42,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-15 03:03:42,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:42,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-15 03:03:42,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=953, Unknown=0, NotChecked=0, Total=1056 [2019-10-15 03:03:42,967 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 33 states. [2019-10-15 03:03:43,548 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-10-15 03:03:44,235 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-10-15 03:03:44,927 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-15 03:03:45,503 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-15 03:03:46,776 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-10-15 03:03:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:47,008 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2019-10-15 03:03:47,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-15 03:03:47,009 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 15 [2019-10-15 03:03:47,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:47,014 INFO L225 Difference]: With dead ends: 78 [2019-10-15 03:03:47,014 INFO L226 Difference]: Without dead ends: 76 [2019-10-15 03:03:47,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=531, Invalid=3501, Unknown=0, NotChecked=0, Total=4032 [2019-10-15 03:03:47,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-15 03:03:47,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 35. [2019-10-15 03:03:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 03:03:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-10-15 03:03:47,036 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 15 [2019-10-15 03:03:47,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:47,037 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-10-15 03:03:47,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-15 03:03:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2019-10-15 03:03:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 03:03:47,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:47,039 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:47,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:47,246 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:47,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:47,246 INFO L82 PathProgramCache]: Analyzing trace with hash -974186864, now seen corresponding path program 1 times [2019-10-15 03:03:47,248 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:47,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591070576] [2019-10-15 03:03:47,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:47,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:47,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:47,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591070576] [2019-10-15 03:03:47,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137596565] [2019-10-15 03:03:47,467 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-15 03:03:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:47,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 03:03:47,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:47,582 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:47,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [126845828] [2019-10-15 03:03:47,634 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-15 03:03:47,634 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:47,636 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:47,636 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:47,637 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:47,679 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:03:48,149 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-15 03:03:48,158 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:03:48,164 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:48,919 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:48,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 11] total 17 [2019-10-15 03:03:48,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756377800] [2019-10-15 03:03:48,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-15 03:03:48,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:48,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-15 03:03:48,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-15 03:03:48,922 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 17 states. [2019-10-15 03:03:50,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:50,577 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-10-15 03:03:50,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 03:03:50,580 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2019-10-15 03:03:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:50,583 INFO L225 Difference]: With dead ends: 75 [2019-10-15 03:03:50,583 INFO L226 Difference]: Without dead ends: 56 [2019-10-15 03:03:50,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2019-10-15 03:03:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-15 03:03:50,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 37. [2019-10-15 03:03:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 03:03:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-10-15 03:03:50,597 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 19 [2019-10-15 03:03:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:50,597 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-10-15 03:03:50,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-15 03:03:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-10-15 03:03:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:03:50,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:50,599 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:50,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:50,803 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:50,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:50,804 INFO L82 PathProgramCache]: Analyzing trace with hash 167961903, now seen corresponding path program 2 times [2019-10-15 03:03:50,805 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:50,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845074628] [2019-10-15 03:03:50,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:50,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:50,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:51,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845074628] [2019-10-15 03:03:51,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719718594] [2019-10-15 03:03:51,250 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 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-15 03:03:51,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-15 03:03:51,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:03:51,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-15 03:03:51,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:51,604 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:51,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:51,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1486197774] [2019-10-15 03:03:51,949 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-15 03:03:51,949 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:51,950 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:51,950 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:51,950 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:51,974 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:03:52,230 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-15 03:03:52,236 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:03:52,239 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:53,274 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:53,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-15 03:03:53,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70770421] [2019-10-15 03:03:53,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-15 03:03:53,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:53,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-15 03:03:53,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1090, Unknown=0, NotChecked=0, Total=1190 [2019-10-15 03:03:53,277 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 35 states. [2019-10-15 03:03:54,420 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-10-15 03:03:55,903 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-10-15 03:03:56,700 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-10-15 03:03:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:58,273 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2019-10-15 03:03:58,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-15 03:03:58,274 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 21 [2019-10-15 03:03:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:58,279 INFO L225 Difference]: With dead ends: 96 [2019-10-15 03:03:58,279 INFO L226 Difference]: Without dead ends: 94 [2019-10-15 03:03:58,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 32 SyntacticMatches, 11 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=722, Invalid=4680, Unknown=0, NotChecked=0, Total=5402 [2019-10-15 03:03:58,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-15 03:03:58,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 43. [2019-10-15 03:03:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-15 03:03:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-10-15 03:03:58,322 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 21 [2019-10-15 03:03:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:58,322 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-10-15 03:03:58,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-15 03:03:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-10-15 03:03:58,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 03:03:58,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:58,325 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:58,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:58,529 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:58,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:58,530 INFO L82 PathProgramCache]: Analyzing trace with hash -242389062, now seen corresponding path program 1 times [2019-10-15 03:03:58,530 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:58,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808356128] [2019-10-15 03:03:58,531 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:58,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:58,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:58,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808356128] [2019-10-15 03:03:58,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514271774] [2019-10-15 03:03:58,896 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-15 03:03:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:58,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 03:03:58,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:59,070 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:59,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1727105481] [2019-10-15 03:03:59,191 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 03:03:59,191 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:59,192 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:59,192 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:59,192 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:59,220 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:04:00,114 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 35 for LOIs [2019-10-15 03:04:00,128 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:04:00,131 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:04:01,029 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:04:01,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6, 13] total 25 [2019-10-15 03:04:01,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983699385] [2019-10-15 03:04:01,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-15 03:04:01,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:04:01,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-15 03:04:01,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2019-10-15 03:04:01,032 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 25 states. [2019-10-15 03:04:01,601 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-10-15 03:04:02,528 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-10-15 03:04:03,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:04:03,799 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2019-10-15 03:04:03,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-15 03:04:03,799 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 22 [2019-10-15 03:04:03,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:04:03,801 INFO L225 Difference]: With dead ends: 81 [2019-10-15 03:04:03,801 INFO L226 Difference]: Without dead ends: 64 [2019-10-15 03:04:03,803 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=393, Invalid=2157, Unknown=0, NotChecked=0, Total=2550 [2019-10-15 03:04:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-15 03:04:03,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 43. [2019-10-15 03:04:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-15 03:04:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-10-15 03:04:03,816 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 22 [2019-10-15 03:04:03,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:04:03,816 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-10-15 03:04:03,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-15 03:04:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2019-10-15 03:04:03,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 03:04:03,818 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:04:03,818 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:04:04,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:04:04,025 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:04:04,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:04:04,026 INFO L82 PathProgramCache]: Analyzing trace with hash 72483108, now seen corresponding path program 3 times [2019-10-15 03:04:04,026 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:04:04,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760487337] [2019-10-15 03:04:04,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:04:04,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:04:04,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:04:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:04:04,740 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2019-10-15 03:04:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:04:05,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760487337] [2019-10-15 03:04:05,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099340922] [2019-10-15 03:04:05,140 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 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-15 03:04:05,265 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 03:04:05,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:04:05,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-15 03:04:05,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:04:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:04:05,916 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:04:10,191 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 17 [2019-10-15 03:04:11,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (let ((.cse2 (* c_main_~i~0 4))) (let ((.cse3 (+ .cse2 |c_main_~#v~0.offset|))) (store (let ((.cse1 (select |c_#memory_int| |c_main_~#v~0.base|))) (store .cse1 (+ .cse2 |c_main_~#v~0.offset| 4) (select .cse1 .cse3))) .cse3 main_~key~0))))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2019-10-15 03:04:17,491 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int) (v_subst_2 Int)) (let ((.cse0 (let ((.cse2 (* c_main_~j~0 4))) (let ((.cse3 (+ .cse2 |c_main_~#v~0.offset|))) (store (let ((.cse1 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* c_main_~i~0 4) |c_main_~#v~0.offset| 4) main_~key~0))) (store .cse1 (+ .cse2 |c_main_~#v~0.offset| 4) (select .cse1 .cse3))) .cse3 v_subst_2))))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false