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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:01:24,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:01:24,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:01:24,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:01:24,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:01:24,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:01:24,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:01:24,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:01:24,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:01:24,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:01:24,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:01:24,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:01:24,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:01:24,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:01:24,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:01:24,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:01:24,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:01:24,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:01:24,261 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:01:24,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:01:24,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:01:24,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:01:24,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:01:24,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:01:24,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:01:24,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:01:24,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:01:24,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:01:24,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:01:24,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:01:24,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:01:24,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:01:24,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:01:24,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:01:24,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:01:24,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:01:24,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:01:24,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:01:24,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:01:24,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:01:24,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:01:24,291 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:01:24,313 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:01:24,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:01:24,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:01:24,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:01:24,316 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:01:24,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:01:24,317 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:01:24,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:01:24,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:01:24,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:01:24,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:01:24,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:01:24,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:01:24,320 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:01:24,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:01:24,320 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:01:24,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:01:24,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:01:24,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:01:24,321 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:01:24,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:01:24,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:01:24,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:01:24,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:01:24,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:01:24,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:01:24,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:01:24,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:01:24,323 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:01:24,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:01:24,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:01:24,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:01:24,656 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:01:24,657 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:01:24,658 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-10-15 03:01:24,717 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7490643c3/855b85cffe2346328f365ea5d045d8a7/FLAG117930bb2 [2019-10-15 03:01:25,205 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:01:25,206 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-10-15 03:01:25,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7490643c3/855b85cffe2346328f365ea5d045d8a7/FLAG117930bb2 [2019-10-15 03:01:25,566 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7490643c3/855b85cffe2346328f365ea5d045d8a7 [2019-10-15 03:01:25,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:01:25,577 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:01:25,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:01:25,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:01:25,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:01:25,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:25,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65599f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25, skipping insertion in model container [2019-10-15 03:01:25,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:25,594 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:01:25,616 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:01:25,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:01:25,828 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:01:25,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:01:25,957 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:01:25,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25 WrapperNode [2019-10-15 03:01:25,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:01:25,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:01:25,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:01:25,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:01:25,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:25,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:25,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:25,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:26,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:26,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:26,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:26,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:01:26,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:01:26,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:01:26,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:01:26,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (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:01:26,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:01:26,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:01:26,088 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:01:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:01:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:01:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 03:01:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-15 03:01:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:01:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 03:01:26,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 03:01:26,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 03:01:26,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:01:26,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:01:26,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 03:01:26,371 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:01:26,371 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:01:26,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:01:26 BoogieIcfgContainer [2019-10-15 03:01:26,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:01:26,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:01:26,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:01:26,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:01:26,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:01:25" (1/3) ... [2019-10-15 03:01:26,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b274332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:01:26, skipping insertion in model container [2019-10-15 03:01:26,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (2/3) ... [2019-10-15 03:01:26,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b274332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:01:26, skipping insertion in model container [2019-10-15 03:01:26,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:01:26" (3/3) ... [2019-10-15 03:01:26,384 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2019-10-15 03:01:26,394 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:01:26,404 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-15 03:01:26,423 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-15 03:01:26,461 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:01:26,462 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:01:26,462 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:01:26,462 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:01:26,462 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:01:26,462 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:01:26,463 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:01:26,463 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:01:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-15 03:01:26,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:01:26,502 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:26,503 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:26,505 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:26,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:26,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1493056857, now seen corresponding path program 1 times [2019-10-15 03:01:26,523 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:26,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680129889] [2019-10-15 03:01:26,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:26,739 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:01:26,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680129889] [2019-10-15 03:01:26,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:26,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:01:26,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718421223] [2019-10-15 03:01:26,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:01:26,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:26,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:01:26,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:01:26,769 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-10-15 03:01:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:26,814 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2019-10-15 03:01:26,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:01:26,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-15 03:01:26,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:26,833 INFO L225 Difference]: With dead ends: 50 [2019-10-15 03:01:26,834 INFO L226 Difference]: Without dead ends: 32 [2019-10-15 03:01:26,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:01:26,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-15 03:01:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-10-15 03:01:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-15 03:01:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-15 03:01:26,909 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 12 [2019-10-15 03:01:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:26,910 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-15 03:01:26,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:01:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-15 03:01:26,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:01:26,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:26,912 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:26,913 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:26,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1230815368, now seen corresponding path program 1 times [2019-10-15 03:01:26,915 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:26,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697053010] [2019-10-15 03:01:26,915 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:27,024 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:01:27,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697053010] [2019-10-15 03:01:27,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:27,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:01:27,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178864561] [2019-10-15 03:01:27,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:01:27,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:27,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:01:27,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:01:27,031 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 4 states. [2019-10-15 03:01:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:27,081 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2019-10-15 03:01:27,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:01:27,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-15 03:01:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:27,083 INFO L225 Difference]: With dead ends: 50 [2019-10-15 03:01:27,083 INFO L226 Difference]: Without dead ends: 48 [2019-10-15 03:01:27,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:01:27,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-15 03:01:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2019-10-15 03:01:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-15 03:01:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-10-15 03:01:27,093 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2019-10-15 03:01:27,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:27,094 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-10-15 03:01:27,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:01:27,094 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-10-15 03:01:27,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:01:27,095 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:27,095 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:27,096 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:27,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:27,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1294538317, now seen corresponding path program 1 times [2019-10-15 03:01:27,096 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:27,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795902440] [2019-10-15 03:01:27,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:27,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:27,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:27,152 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:01:27,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795902440] [2019-10-15 03:01:27,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:27,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:01:27,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827853793] [2019-10-15 03:01:27,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:01:27,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:27,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:01:27,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:01:27,159 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 3 states. [2019-10-15 03:01:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:27,223 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-10-15 03:01:27,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:01:27,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-15 03:01:27,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:27,225 INFO L225 Difference]: With dead ends: 59 [2019-10-15 03:01:27,225 INFO L226 Difference]: Without dead ends: 39 [2019-10-15 03:01:27,226 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:01:27,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-15 03:01:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2019-10-15 03:01:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-15 03:01:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-15 03:01:27,233 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 13 [2019-10-15 03:01:27,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:27,234 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-15 03:01:27,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:01:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-15 03:01:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 03:01:27,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:27,235 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:27,236 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:27,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:27,236 INFO L82 PathProgramCache]: Analyzing trace with hash -442233424, now seen corresponding path program 1 times [2019-10-15 03:01:27,237 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:27,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714756118] [2019-10-15 03:01:27,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:27,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:27,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:27,279 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:01:27,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714756118] [2019-10-15 03:01:27,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:27,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:01:27,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128525362] [2019-10-15 03:01:27,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:01:27,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:27,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:01:27,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:01:27,282 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 3 states. [2019-10-15 03:01:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:27,342 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-10-15 03:01:27,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:01:27,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-15 03:01:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:27,345 INFO L225 Difference]: With dead ends: 53 [2019-10-15 03:01:27,346 INFO L226 Difference]: Without dead ends: 33 [2019-10-15 03:01:27,346 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:01:27,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-15 03:01:27,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-10-15 03:01:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-15 03:01:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-15 03:01:27,352 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 14 [2019-10-15 03:01:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:27,352 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-15 03:01:27,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:01:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-15 03:01:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 03:01:27,353 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:27,353 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:27,354 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:27,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:27,354 INFO L82 PathProgramCache]: Analyzing trace with hash -503898809, now seen corresponding path program 1 times [2019-10-15 03:01:27,354 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:27,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741254411] [2019-10-15 03:01:27,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:27,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:27,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:28,405 WARN L191 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 86 [2019-10-15 03:01:28,882 WARN L191 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 89 [2019-10-15 03:01:28,905 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:01:28,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741254411] [2019-10-15 03:01:28,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:28,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:01:28,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784657963] [2019-10-15 03:01:28,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:01:28,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:28,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:01:28,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:01:28,908 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 9 states. [2019-10-15 03:01:29,355 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 46 [2019-10-15 03:01:29,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:29,411 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-10-15 03:01:29,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:01:29,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-10-15 03:01:29,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:29,413 INFO L225 Difference]: With dead ends: 43 [2019-10-15 03:01:29,413 INFO L226 Difference]: Without dead ends: 28 [2019-10-15 03:01:29,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:01:29,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-15 03:01:29,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-15 03:01:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-15 03:01:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-10-15 03:01:29,419 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 19 [2019-10-15 03:01:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:29,420 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-10-15 03:01:29,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:01:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-10-15 03:01:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 03:01:29,421 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:29,421 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:29,421 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:29,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:29,422 INFO L82 PathProgramCache]: Analyzing trace with hash 907184126, now seen corresponding path program 1 times [2019-10-15 03:01:29,422 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:29,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654627151] [2019-10-15 03:01:29,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:29,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:29,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:29,465 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:01:29,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654627151] [2019-10-15 03:01:29,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:29,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:01:29,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884612939] [2019-10-15 03:01:29,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:01:29,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:29,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:01:29,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:01:29,467 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 6 states. [2019-10-15 03:01:29,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:29,522 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-10-15 03:01:29,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:01:29,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-15 03:01:29,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:29,524 INFO L225 Difference]: With dead ends: 41 [2019-10-15 03:01:29,524 INFO L226 Difference]: Without dead ends: 39 [2019-10-15 03:01:29,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:01:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-15 03:01:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2019-10-15 03:01:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-15 03:01:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-10-15 03:01:29,530 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2019-10-15 03:01:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:29,530 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-10-15 03:01:29,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:01:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-10-15 03:01:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:01:29,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:29,531 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:29,532 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:29,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1084636737, now seen corresponding path program 1 times [2019-10-15 03:01:29,532 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:29,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738267438] [2019-10-15 03:01:29,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:29,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:29,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:29,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738267438] [2019-10-15 03:01:29,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73557037] [2019-10-15 03:01:29,733 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:01:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:29,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-15 03:01:29,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:01:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:29,887 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:01:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:31,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1127914271] [2019-10-15 03:01:31,060 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-15 03:01:31,060 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:01:31,067 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:01:31,075 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:01:31,075 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:01:31,293 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-15 03:01:32,283 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 19 for LOIs [2019-10-15 03:01:32,299 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:01:34,662 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-10-15 03:01:35,049 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-10-15 03:01:35,218 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-10-15 03:01:35,403 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-10-15 03:01:35,609 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-10-15 03:01:35,869 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-10-15 03:01:38,196 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-10-15 03:01:40,566 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-10-15 03:01:41,035 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-10-15 03:01:41,038 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:01:41,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4, 15] total 24 [2019-10-15 03:01:41,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127076625] [2019-10-15 03:01:41,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-15 03:01:41,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:41,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-15 03:01:41,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2019-10-15 03:01:41,041 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 24 states. [2019-10-15 03:01:44,103 WARN L191 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 52 [2019-10-15 03:01:48,958 WARN L191 SmtUtils]: Spent 4.76 s on a formula simplification that was a NOOP. DAG size: 71 [2019-10-15 03:01:53,312 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4294967296 (div c_main_~main__index2~0 4294967296)))) (and (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (div (+ c_main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* c_main_~main__index2~0 (- 1)) 99998) 4294967296)) c_main_~main__index2~0 1)) (<= c_main_~main__index2~0 (+ .cse0 99999)) (<= (+ c_main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div c_main_~main__index1~0 4294967296)) c_main_~main__index2~0)))) is different from false [2019-10-15 03:01:53,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:53,463 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2019-10-15 03:01:53,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 03:01:53,464 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-10-15 03:01:53,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:53,465 INFO L225 Difference]: With dead ends: 53 [2019-10-15 03:01:53,465 INFO L226 Difference]: Without dead ends: 41 [2019-10-15 03:01:53,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=141, Invalid=674, Unknown=1, NotChecked=54, Total=870 [2019-10-15 03:01:53,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-15 03:01:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2019-10-15 03:01:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-15 03:01:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-10-15 03:01:53,481 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 21 [2019-10-15 03:01:53,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:53,482 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-10-15 03:01:53,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-15 03:01:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-10-15 03:01:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-15 03:01:53,483 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:53,484 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:53,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:01:53,689 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:53,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash -517655999, now seen corresponding path program 1 times [2019-10-15 03:01:53,690 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:53,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150729140] [2019-10-15 03:01:53,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:53,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:53,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:54,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150729140] [2019-10-15 03:01:54,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290483654] [2019-10-15 03:01:54,101 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:01:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:54,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-15 03:01:54,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:01:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 03:01:55,195 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:01:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 03:01:59,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1964047307] [2019-10-15 03:01:59,517 INFO L162 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-10-15 03:01:59,517 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:01:59,518 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:01:59,518 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:01:59,518 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:01:59,559 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-15 03:02:00,872 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 19 for LOIs [2019-10-15 03:02:00,881 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:02:01,258 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-10-15 03:02:01,901 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-10-15 03:02:02,184 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-10-15 03:02:02,390 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-10-15 03:02:02,770 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-10-15 03:02:05,910 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-10-15 03:02:06,175 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-10-15 03:02:06,542 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-10-15 03:02:07,138 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2019-10-15 03:02:07,361 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-10-15 03:02:07,362 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:02:07,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4, 17] total 30 [2019-10-15 03:02:07,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617170353] [2019-10-15 03:02:07,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-15 03:02:07,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:07,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-15 03:02:07,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2019-10-15 03:02:07,365 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 30 states. [2019-10-15 03:02:08,081 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75