java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-crafted/zero_sum_const3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:30:59,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:30:59,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:30:59,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:30:59,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:30:59,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:30:59,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:30:59,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:30:59,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:30:59,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:30:59,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:30:59,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:30:59,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:30:59,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:30:59,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:30:59,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:30:59,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:30:59,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:30:59,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:30:59,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:30:59,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:30:59,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:30:59,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:30:59,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:30:59,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:30:59,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:30:59,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:30:59,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:30:59,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:30:59,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:30:59,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:30:59,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:30:59,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:30:59,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:30:59,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:30:59,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:30:59,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:30:59,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:30:59,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:30:59,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:30:59,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:30:59,306 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 01:30:59,319 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:30:59,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:30:59,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:30:59,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:30:59,321 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:30:59,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:30:59,322 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:30:59,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:30:59,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:30:59,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:30:59,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:30:59,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:30:59,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:30:59,323 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:30:59,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:30:59,324 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:30:59,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:30:59,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:30:59,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:30:59,325 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:30:59,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:30:59,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:30:59,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:30:59,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:30:59,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:30:59,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:30:59,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:30:59,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:30:59,326 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 01:30:59,597 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:30:59,615 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:30:59,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:30:59,621 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:30:59,622 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:30:59,623 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_const3.c [2019-10-15 01:30:59,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7375a47e1/3ec544b2ecbf49dc9440203cfa960775/FLAGd01a628a6 [2019-10-15 01:31:00,178 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:31:00,179 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_const3.c [2019-10-15 01:31:00,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7375a47e1/3ec544b2ecbf49dc9440203cfa960775/FLAGd01a628a6 [2019-10-15 01:31:00,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7375a47e1/3ec544b2ecbf49dc9440203cfa960775 [2019-10-15 01:31:00,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:31:00,552 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:31:00,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:31:00,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:31:00,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:31:00,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:31:00" (1/1) ... [2019-10-15 01:31:00,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ed5976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:00, skipping insertion in model container [2019-10-15 01:31:00,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:31:00" (1/1) ... [2019-10-15 01:31:00,571 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:31:00,592 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:31:00,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:31:00,788 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:31:00,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:31:00,823 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:31:00,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:00 WrapperNode [2019-10-15 01:31:00,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:31:00,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:31:00,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:31:00,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:31:00,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:00" (1/1) ... [2019-10-15 01:31:00,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:00" (1/1) ... [2019-10-15 01:31:00,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:00" (1/1) ... [2019-10-15 01:31:00,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:00" (1/1) ... [2019-10-15 01:31:00,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:00" (1/1) ... [2019-10-15 01:31:00,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:00" (1/1) ... [2019-10-15 01:31:00,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:00" (1/1) ... [2019-10-15 01:31:00,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:31:00,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:31:00,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:31:00,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:31:00,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:00" (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 01:31:01,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:31:01,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:31:01,023 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:31:01,023 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:31:01,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:31:01,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:31:01,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:31:01,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:31:01,024 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:31:01,024 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:31:01,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:31:01,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:31:01,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:31:01,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:31:01,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:31:01,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:31:01,525 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:31:01,526 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-15 01:31:01,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:31:01 BoogieIcfgContainer [2019-10-15 01:31:01,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:31:01,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:31:01,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:31:01,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:31:01,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:31:00" (1/3) ... [2019-10-15 01:31:01,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67713b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:31:01, skipping insertion in model container [2019-10-15 01:31:01,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:00" (2/3) ... [2019-10-15 01:31:01,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67713b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:31:01, skipping insertion in model container [2019-10-15 01:31:01,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:31:01" (3/3) ... [2019-10-15 01:31:01,535 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum_const3.c [2019-10-15 01:31:01,544 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:31:01,552 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:31:01,563 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:31:01,589 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:31:01,589 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:31:01,589 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:31:01,589 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:31:01,589 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:31:01,590 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:31:01,590 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:31:01,590 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:31:01,608 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-15 01:31:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:31:01,614 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:01,615 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:01,617 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:01,623 INFO L82 PathProgramCache]: Analyzing trace with hash -68481076, now seen corresponding path program 1 times [2019-10-15 01:31:01,632 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:01,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446363015] [2019-10-15 01:31:01,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:01,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:01,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:01,850 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 01:31:01,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446363015] [2019-10-15 01:31:01,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:31:01,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:31:01,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834533546] [2019-10-15 01:31:01,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:31:01,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:01,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:31:01,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:31:01,873 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2019-10-15 01:31:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:01,991 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2019-10-15 01:31:01,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:31:01,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-15 01:31:01,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:02,006 INFO L225 Difference]: With dead ends: 45 [2019-10-15 01:31:02,007 INFO L226 Difference]: Without dead ends: 24 [2019-10-15 01:31:02,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:31:02,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-15 01:31:02,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-15 01:31:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-15 01:31:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-10-15 01:31:02,049 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 17 [2019-10-15 01:31:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:02,050 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-10-15 01:31:02,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:31:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2019-10-15 01:31:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:31:02,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:02,052 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:02,052 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:02,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:02,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1579005837, now seen corresponding path program 1 times [2019-10-15 01:31:02,055 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:02,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279778457] [2019-10-15 01:31:02,056 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:02,056 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:02,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:31:02,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279778457] [2019-10-15 01:31:02,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:31:02,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:31:02,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157681590] [2019-10-15 01:31:02,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:31:02,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:02,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:31:02,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:31:02,170 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. [2019-10-15 01:31:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:02,212 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2019-10-15 01:31:02,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:31:02,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 01:31:02,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:02,214 INFO L225 Difference]: With dead ends: 42 [2019-10-15 01:31:02,214 INFO L226 Difference]: Without dead ends: 25 [2019-10-15 01:31:02,215 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 01:31:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-15 01:31:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-15 01:31:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 01:31:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2019-10-15 01:31:02,222 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 18 [2019-10-15 01:31:02,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:02,222 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2019-10-15 01:31:02,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:31:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2019-10-15 01:31:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:31:02,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:02,223 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 01:31:02,224 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:02,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:02,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1817549222, now seen corresponding path program 1 times [2019-10-15 01:31:02,225 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:02,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328339365] [2019-10-15 01:31:02,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:02,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:02,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:31:02,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328339365] [2019-10-15 01:31:02,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:31:02,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:31:02,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961086417] [2019-10-15 01:31:02,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:31:02,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:02,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:31:02,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:31:02,288 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand 4 states. [2019-10-15 01:31:02,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:02,372 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2019-10-15 01:31:02,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:31:02,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-15 01:31:02,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:02,374 INFO L225 Difference]: With dead ends: 40 [2019-10-15 01:31:02,374 INFO L226 Difference]: Without dead ends: 25 [2019-10-15 01:31:02,375 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:31:02,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-15 01:31:02,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-15 01:31:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 01:31:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-10-15 01:31:02,382 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 19 [2019-10-15 01:31:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:02,382 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-10-15 01:31:02,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:31:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2019-10-15 01:31:02,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:31:02,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:02,384 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:02,384 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:02,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:02,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2017864887, now seen corresponding path program 1 times [2019-10-15 01:31:02,385 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:02,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38953067] [2019-10-15 01:31:02,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:02,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:02,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:31:02,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38953067] [2019-10-15 01:31:02,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70787329] [2019-10-15 01:31:02,459 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 01:31:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:02,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:31:02,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:31:02,617 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:31:02,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2055905479] [2019-10-15 01:31:02,679 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:31:02,680 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:02,686 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:02,702 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:02,705 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:02,904 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-15 01:31:04,475 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:31:04,528 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:31:04,534 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:05,016 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-15 01:31:05,400 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-15 01:31:05,403 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:05,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-15 01:31:05,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127165247] [2019-10-15 01:31:05,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 01:31:05,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:05,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 01:31:05,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:31:05,407 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 18 states. [2019-10-15 01:31:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:06,275 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2019-10-15 01:31:06,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:31:06,275 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-10-15 01:31:06,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:06,276 INFO L225 Difference]: With dead ends: 43 [2019-10-15 01:31:06,276 INFO L226 Difference]: Without dead ends: 26 [2019-10-15 01:31:06,277 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2019-10-15 01:31:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-15 01:31:06,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-15 01:31:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-15 01:31:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-10-15 01:31:06,287 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 24 [2019-10-15 01:31:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:06,287 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-15 01:31:06,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-15 01:31:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-10-15 01:31:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:31:06,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:06,288 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, 1, 1, 1, 1] [2019-10-15 01:31:06,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:06,494 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:06,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:06,495 INFO L82 PathProgramCache]: Analyzing trace with hash -997981858, now seen corresponding path program 2 times [2019-10-15 01:31:06,495 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:06,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011490956] [2019-10-15 01:31:06,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:06,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:06,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:31:06,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011490956] [2019-10-15 01:31:06,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594285202] [2019-10-15 01:31:06,616 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:06,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 01:31:06,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:31:06,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:31:06,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:31:06,748 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:31:06,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [737970176] [2019-10-15 01:31:06,773 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:31:06,773 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:06,774 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:06,774 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:06,775 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:06,828 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-15 01:31:07,699 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:31:07,739 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:31:07,746 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:08,495 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:08,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-15 01:31:08,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643173197] [2019-10-15 01:31:08,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-15 01:31:08,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:08,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-15 01:31:08,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:31:08,500 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 19 states. [2019-10-15 01:31:09,422 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-10-15 01:31:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:09,501 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2019-10-15 01:31:09,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:31:09,501 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-10-15 01:31:09,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:09,503 INFO L225 Difference]: With dead ends: 47 [2019-10-15 01:31:09,503 INFO L226 Difference]: Without dead ends: 32 [2019-10-15 01:31:09,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:31:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-15 01:31:09,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-15 01:31:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-15 01:31:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-10-15 01:31:09,513 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 25 [2019-10-15 01:31:09,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:09,513 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-15 01:31:09,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-15 01:31:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-10-15 01:31:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:31:09,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:09,515 INFO L380 BasicCegarLoop]: trace histogram [2, 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 01:31:09,724 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:09,725 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:09,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:09,725 INFO L82 PathProgramCache]: Analyzing trace with hash 567715820, now seen corresponding path program 3 times [2019-10-15 01:31:09,725 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:09,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567651415] [2019-10-15 01:31:09,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:09,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:09,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:10,634 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 01:31:10,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567651415] [2019-10-15 01:31:10,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702395602] [2019-10-15 01:31:10,635 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:10,709 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:31:10,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:31:10,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-15 01:31:10,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:10,974 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 01:31:10,974 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:31:11,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1138916775] [2019-10-15 01:31:11,236 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:31:11,237 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:11,237 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:11,237 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:11,238 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:11,267 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-15 01:31:12,023 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:31:12,055 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:31:12,059 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:12,646 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-15 01:31:13,136 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-15 01:31:13,136 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:13,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10, 11] total 39 [2019-10-15 01:31:13,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627429136] [2019-10-15 01:31:13,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-15 01:31:13,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:13,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-15 01:31:13,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1356, Unknown=0, NotChecked=0, Total=1482 [2019-10-15 01:31:13,143 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 39 states. [2019-10-15 01:31:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:14,862 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2019-10-15 01:31:14,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 01:31:14,865 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 31 [2019-10-15 01:31:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:14,866 INFO L225 Difference]: With dead ends: 53 [2019-10-15 01:31:14,867 INFO L226 Difference]: Without dead ends: 48 [2019-10-15 01:31:14,868 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 62 SyntacticMatches, 18 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=240, Invalid=2516, Unknown=0, NotChecked=0, Total=2756 [2019-10-15 01:31:14,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-15 01:31:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-10-15 01:31:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-15 01:31:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2019-10-15 01:31:14,880 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 31 [2019-10-15 01:31:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:14,881 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2019-10-15 01:31:14,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-15 01:31:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2019-10-15 01:31:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:31:14,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:14,882 INFO L380 BasicCegarLoop]: trace histogram [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 01:31:15,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:15,084 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:15,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:15,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1042486227, now seen corresponding path program 4 times [2019-10-15 01:31:15,086 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:15,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612031551] [2019-10-15 01:31:15,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:15,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:15,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 01:31:15,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612031551] [2019-10-15 01:31:15,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188063085] [2019-10-15 01:31:15,161 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:15,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:31:15,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 01:31:15,297 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 01:31:15,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1055102099] [2019-10-15 01:31:15,340 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:31:15,340 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:15,340 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:15,341 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:15,341 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:15,369 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-15 01:31:16,060 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:31:16,088 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:31:16,092 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:16,915 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:16,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 24 [2019-10-15 01:31:16,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468738776] [2019-10-15 01:31:16,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-15 01:31:16,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:16,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-15 01:31:16,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:31:16,918 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand 24 states. [2019-10-15 01:31:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:18,092 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2019-10-15 01:31:18,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-15 01:31:18,096 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-10-15 01:31:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:18,099 INFO L225 Difference]: With dead ends: 92 [2019-10-15 01:31:18,099 INFO L226 Difference]: Without dead ends: 53 [2019-10-15 01:31:18,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=219, Invalid=1263, Unknown=0, NotChecked=0, Total=1482 [2019-10-15 01:31:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-15 01:31:18,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-10-15 01:31:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-15 01:31:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2019-10-15 01:31:18,110 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 32 [2019-10-15 01:31:18,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:18,111 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2019-10-15 01:31:18,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-15 01:31:18,111 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2019-10-15 01:31:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:31:18,112 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:18,112 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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 01:31:18,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:18,322 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1643204986, now seen corresponding path program 5 times [2019-10-15 01:31:18,323 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:18,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340642640] [2019-10-15 01:31:18,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:18,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:18,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:31:18,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340642640] [2019-10-15 01:31:18,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739276693] [2019-10-15 01:31:18,379 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:18,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:31:18,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:31:18,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:31:18,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:31:18,542 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:31:18,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1377079140] [2019-10-15 01:31:18,592 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:31:18,592 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:18,593 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:18,594 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:18,594 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:18,619 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-15 01:31:19,188 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:31:19,219 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:31:19,222 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:20,024 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:20,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 25 [2019-10-15 01:31:20,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088975139] [2019-10-15 01:31:20,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-15 01:31:20,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:20,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-15 01:31:20,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:31:20,027 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 25 states. [2019-10-15 01:31:21,380 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-10-15 01:31:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:21,463 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-15 01:31:21,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:31:21,463 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 33 [2019-10-15 01:31:21,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:21,464 INFO L225 Difference]: With dead ends: 56 [2019-10-15 01:31:21,465 INFO L226 Difference]: Without dead ends: 39 [2019-10-15 01:31:21,466 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=213, Invalid=1269, Unknown=0, NotChecked=0, Total=1482 [2019-10-15 01:31:21,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-15 01:31:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-15 01:31:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 01:31:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-10-15 01:31:21,473 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 33 [2019-10-15 01:31:21,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:21,474 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-10-15 01:31:21,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-15 01:31:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-10-15 01:31:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 01:31:21,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:21,475 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:21,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:21,679 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:21,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:21,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1638161385, now seen corresponding path program 6 times [2019-10-15 01:31:21,680 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:21,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300894915] [2019-10-15 01:31:21,681 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:21,681 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:21,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:22,439 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-10-15 01:31:22,583 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-10-15 01:31:22,827 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-10-15 01:31:22,999 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-10-15 01:31:23,516 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-10-15 01:31:23,677 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-10-15 01:31:23,932 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-10-15 01:31:24,326 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2019-10-15 01:31:24,617 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-10-15 01:31:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:31:25,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300894915] [2019-10-15 01:31:25,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334192922] [2019-10-15 01:31:25,077 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:25,195 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:31:25,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:31:25,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 87 conjunts are in the unsatisfiable core [2019-10-15 01:31:25,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:31:25,762 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:31:26,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1891037913] [2019-10-15 01:31:26,172 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:31:26,172 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:26,172 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:26,173 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:26,173 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:26,214 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-15 01:31:26,898 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:31:26,927 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:31:26,930 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:28,094 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:28,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 16, 12, 11] total 63 [2019-10-15 01:31:28,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716588633] [2019-10-15 01:31:28,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-15 01:31:28,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:28,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-15 01:31:28,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=3592, Unknown=0, NotChecked=0, Total=3906 [2019-10-15 01:31:28,099 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 63 states. [2019-10-15 01:31:28,963 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-10-15 01:31:29,331 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-10-15 01:31:29,538 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2019-10-15 01:31:31,046 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 56 [2019-10-15 01:31:31,394 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42 [2019-10-15 01:31:31,748 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-10-15 01:31:32,012 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 47 [2019-10-15 01:31:33,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:33,283 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2019-10-15 01:31:33,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-15 01:31:33,283 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 38 [2019-10-15 01:31:33,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:33,284 INFO L225 Difference]: With dead ends: 89 [2019-10-15 01:31:33,284 INFO L226 Difference]: Without dead ends: 44 [2019-10-15 01:31:33,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 75 SyntacticMatches, 10 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3109 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=718, Invalid=7472, Unknown=0, NotChecked=0, Total=8190 [2019-10-15 01:31:33,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-15 01:31:33,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2019-10-15 01:31:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-15 01:31:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-10-15 01:31:33,298 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 38 [2019-10-15 01:31:33,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:33,298 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-10-15 01:31:33,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-15 01:31:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-10-15 01:31:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 01:31:33,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:33,300 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:33,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:33,504 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash -163628948, now seen corresponding path program 7 times [2019-10-15 01:31:33,505 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:33,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704261358] [2019-10-15 01:31:33,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:33,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:33,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:31:33,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704261358] [2019-10-15 01:31:33,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736736102] [2019-10-15 01:31:33,585 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:33,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:31:33,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:31:33,768 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:31:33,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [797817003] [2019-10-15 01:31:33,811 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:31:33,811 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:33,812 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:33,812 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:33,812 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:33,836 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-15 01:31:34,395 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:31:34,423 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:31:34,427 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:34,952 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-15 01:31:35,327 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:35,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 11] total 27 [2019-10-15 01:31:35,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13806811] [2019-10-15 01:31:35,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-15 01:31:35,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:35,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-15 01:31:35,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2019-10-15 01:31:35,330 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 27 states. [2019-10-15 01:31:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:36,755 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2019-10-15 01:31:36,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-15 01:31:36,756 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 39 [2019-10-15 01:31:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:36,757 INFO L225 Difference]: With dead ends: 94 [2019-10-15 01:31:36,757 INFO L226 Difference]: Without dead ends: 64 [2019-10-15 01:31:36,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 95 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=289, Invalid=1691, Unknown=0, NotChecked=0, Total=1980 [2019-10-15 01:31:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-15 01:31:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-10-15 01:31:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-15 01:31:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-10-15 01:31:36,770 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 39 [2019-10-15 01:31:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:36,771 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-10-15 01:31:36,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-15 01:31:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-10-15 01:31:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 01:31:36,772 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:36,772 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:36,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:36,976 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:36,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:36,977 INFO L82 PathProgramCache]: Analyzing trace with hash -96034587, now seen corresponding path program 8 times [2019-10-15 01:31:36,977 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:36,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549871895] [2019-10-15 01:31:36,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:36,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:36,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-15 01:31:37,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549871895] [2019-10-15 01:31:37,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578092270] [2019-10-15 01:31:37,059 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:37,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:31:37,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:31:37,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:31:37,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:37,281 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-15 01:31:37,282 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-15 01:31:37,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2145745711] [2019-10-15 01:31:37,347 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:31:37,347 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:37,347 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:37,348 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:37,348 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:37,376 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-15 01:31:37,902 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:31:37,922 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:31:37,925 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:38,705 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:38,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 28 [2019-10-15 01:31:38,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184244504] [2019-10-15 01:31:38,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-15 01:31:38,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:38,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-15 01:31:38,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2019-10-15 01:31:38,708 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 28 states. [2019-10-15 01:31:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:40,194 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-10-15 01:31:40,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 01:31:40,195 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 40 [2019-10-15 01:31:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:40,196 INFO L225 Difference]: With dead ends: 67 [2019-10-15 01:31:40,196 INFO L226 Difference]: Without dead ends: 46 [2019-10-15 01:31:40,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 96 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=266, Invalid=1626, Unknown=0, NotChecked=0, Total=1892 [2019-10-15 01:31:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-15 01:31:40,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-15 01:31:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-15 01:31:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-10-15 01:31:40,207 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 40 [2019-10-15 01:31:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:40,208 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-10-15 01:31:40,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-15 01:31:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-10-15 01:31:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 01:31:40,209 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:40,209 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:40,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:40,413 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:40,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:40,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1903048692, now seen corresponding path program 9 times [2019-10-15 01:31:40,414 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:40,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326274600] [2019-10-15 01:31:40,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:40,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:40,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat