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_sum3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:30:31,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:30:31,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:30:31,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:30:31,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:30:31,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:30:31,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:30:31,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:30:31,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:30:31,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:30:31,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:30:31,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:30:31,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:30:31,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:30:31,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:30:31,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:30:31,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:30:31,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:30:31,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:30:31,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:30:31,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:30:31,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:30:31,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:30:31,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:30:31,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:30:31,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:30:31,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:30:31,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:30:31,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:30:31,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:30:31,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:30:31,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:30:31,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:30:31,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:30:31,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:30:31,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:30:31,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:30:31,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:30:31,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:30:31,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:30:31,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:30:31,456 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:31,478 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:30:31,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:30:31,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:30:31,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:30:31,482 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:30:31,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:30:31,482 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:30:31,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:30:31,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:30:31,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:30:31,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:30:31,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:30:31,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:30:31,484 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:30:31,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:30:31,484 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:30:31,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:30:31,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:30:31,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:30:31,486 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:30:31,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:30:31,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:30:31,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:30:31,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:30:31,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:30:31,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:30:31,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:30:31,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:30:31,488 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:31,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:30:31,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:30:31,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:30:31,784 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:30:31,784 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:30:31,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum3.c [2019-10-15 01:30:31,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/711fcf3bc/e2091541d4b24bcfbf2f8bdb5d5de10c/FLAGaed00bcf1 [2019-10-15 01:30:32,366 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:30:32,367 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum3.c [2019-10-15 01:30:32,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/711fcf3bc/e2091541d4b24bcfbf2f8bdb5d5de10c/FLAGaed00bcf1 [2019-10-15 01:30:32,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/711fcf3bc/e2091541d4b24bcfbf2f8bdb5d5de10c [2019-10-15 01:30:32,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:30:32,721 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:30:32,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:30:32,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:30:32,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:30:32,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:30:32" (1/1) ... [2019-10-15 01:30:32,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b073ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:32, skipping insertion in model container [2019-10-15 01:30:32,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:30:32" (1/1) ... [2019-10-15 01:30:32,739 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:30:32,763 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:30:33,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:30:33,084 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:30:33,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:30:33,293 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:30:33,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:33 WrapperNode [2019-10-15 01:30:33,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:30:33,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:30:33,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:30:33,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:30:33,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:33" (1/1) ... [2019-10-15 01:30:33,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:33" (1/1) ... [2019-10-15 01:30:33,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:33" (1/1) ... [2019-10-15 01:30:33,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:33" (1/1) ... [2019-10-15 01:30:33,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:33" (1/1) ... [2019-10-15 01:30:33,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:33" (1/1) ... [2019-10-15 01:30:33,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:33" (1/1) ... [2019-10-15 01:30:33,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:30:33,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:30:33,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:30:33,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:30:33,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:33" (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:30:33,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:30:33,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:30:33,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:30:33,416 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:30:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:30:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:30:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:30:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-10-15 01:30:33,418 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:30:33,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:30:33,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:30:33,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:30:33,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:30:33,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:30:33,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:30:33,924 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:30:33,924 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-15 01:30:33,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:30:33 BoogieIcfgContainer [2019-10-15 01:30:33,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:30:33,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:30:33,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:30:33,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:30:33,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:30:32" (1/3) ... [2019-10-15 01:30:33,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38961ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:30:33, skipping insertion in model container [2019-10-15 01:30:33,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:33" (2/3) ... [2019-10-15 01:30:33,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38961ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:30:33, skipping insertion in model container [2019-10-15 01:30:33,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:30:33" (3/3) ... [2019-10-15 01:30:33,932 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum3.c [2019-10-15 01:30:33,941 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:30:33,949 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:30:33,959 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:30:33,982 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:30:33,982 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:30:33,982 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:30:33,982 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:30:33,983 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:30:33,983 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:30:33,983 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:30:33,983 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:30:33,999 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-15 01:30:34,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:30:34,005 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:34,006 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:30:34,009 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:34,015 INFO L82 PathProgramCache]: Analyzing trace with hash -722993095, now seen corresponding path program 1 times [2019-10-15 01:30:34,025 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:34,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542794853] [2019-10-15 01:30:34,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:34,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:34,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:34,253 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:30:34,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542794853] [2019-10-15 01:30:34,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:30:34,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:30:34,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742097974] [2019-10-15 01:30:34,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:30:34,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:34,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:30:34,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:30:34,282 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2019-10-15 01:30:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:34,410 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2019-10-15 01:30:34,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:30:34,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-15 01:30:34,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:34,423 INFO L225 Difference]: With dead ends: 48 [2019-10-15 01:30:34,423 INFO L226 Difference]: Without dead ends: 24 [2019-10-15 01:30:34,427 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:30:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-15 01:30:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-15 01:30:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-15 01:30:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-10-15 01:30:34,477 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 17 [2019-10-15 01:30:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:34,478 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-10-15 01:30:34,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:30:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2019-10-15 01:30:34,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:30:34,481 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:34,481 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:30:34,481 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:34,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:34,483 INFO L82 PathProgramCache]: Analyzing trace with hash 656684802, now seen corresponding path program 1 times [2019-10-15 01:30:34,483 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:34,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837035508] [2019-10-15 01:30:34,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:34,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:34,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:34,567 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:30:34,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837035508] [2019-10-15 01:30:34,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:30:34,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:30:34,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678184785] [2019-10-15 01:30:34,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:30:34,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:34,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:30:34,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:30:34,571 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. [2019-10-15 01:30:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:34,613 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2019-10-15 01:30:34,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:30:34,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 01:30:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:34,615 INFO L225 Difference]: With dead ends: 42 [2019-10-15 01:30:34,615 INFO L226 Difference]: Without dead ends: 25 [2019-10-15 01:30:34,616 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:30:34,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-15 01:30:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-15 01:30:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 01:30:34,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2019-10-15 01:30:34,623 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 18 [2019-10-15 01:30:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:34,623 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2019-10-15 01:30:34,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:30:34,624 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2019-10-15 01:30:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:30:34,625 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:34,625 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:30:34,625 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:34,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:34,625 INFO L82 PathProgramCache]: Analyzing trace with hash 347884374, now seen corresponding path program 1 times [2019-10-15 01:30:34,626 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:34,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288225508] [2019-10-15 01:30:34,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:34,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:34,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:34,684 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:30:34,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288225508] [2019-10-15 01:30:34,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:30:34,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:30:34,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735480985] [2019-10-15 01:30:34,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:30:34,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:34,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:30:34,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:30:34,690 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand 4 states. [2019-10-15 01:30:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:34,768 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2019-10-15 01:30:34,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:30:34,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-15 01:30:34,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:34,769 INFO L225 Difference]: With dead ends: 40 [2019-10-15 01:30:34,770 INFO L226 Difference]: Without dead ends: 25 [2019-10-15 01:30:34,770 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:30:34,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-15 01:30:34,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-15 01:30:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 01:30:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-10-15 01:30:34,777 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 19 [2019-10-15 01:30:34,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:34,778 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-10-15 01:30:34,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:30:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2019-10-15 01:30:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:30:34,779 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:34,779 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:30:34,779 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:34,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1293658408, now seen corresponding path program 1 times [2019-10-15 01:30:34,780 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:34,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366748440] [2019-10-15 01:30:34,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:34,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:34,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:34,878 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:30:34,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366748440] [2019-10-15 01:30:34,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551255739] [2019-10-15 01:30:34,879 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:30:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:34,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:30:34,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:35,026 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:30:35,026 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:35,074 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:30:35,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [749552042] [2019-10-15 01:30:35,114 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:30:35,114 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:35,120 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:35,126 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:35,127 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:35,283 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:35,743 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:35,776 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:35,787 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:36,171 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:36,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-15 01:30:36,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294029060] [2019-10-15 01:30:36,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-15 01:30:36,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:36,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-15 01:30:36,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:30:36,176 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 17 states. [2019-10-15 01:30:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:36,542 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2019-10-15 01:30:36,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:30:36,543 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-10-15 01:30:36,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:36,544 INFO L225 Difference]: With dead ends: 43 [2019-10-15 01:30:36,544 INFO L226 Difference]: Without dead ends: 26 [2019-10-15 01:30:36,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-10-15 01:30:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-15 01:30:36,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-15 01:30:36,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-15 01:30:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-10-15 01:30:36,551 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 24 [2019-10-15 01:30:36,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:36,551 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-15 01:30:36,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-15 01:30:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-10-15 01:30:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:30:36,552 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:36,553 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:30:36,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:36,764 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:36,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:36,765 INFO L82 PathProgramCache]: Analyzing trace with hash 14691964, now seen corresponding path program 2 times [2019-10-15 01:30:36,765 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:36,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572436711] [2019-10-15 01:30:36,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:36,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:36,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:36,831 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:30:36,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572436711] [2019-10-15 01:30:36,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180140283] [2019-10-15 01:30:36,832 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:30:36,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 01:30:36,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:36,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:30:36,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:36,941 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:30:36,941 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:36,966 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:30:36,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1404807695] [2019-10-15 01:30:36,968 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:30:36,969 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:36,970 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:36,970 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:36,970 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:37,019 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:37,323 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:37,338 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:37,345 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:37,769 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:37,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 18 [2019-10-15 01:30:37,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322470966] [2019-10-15 01:30:37,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 01:30:37,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:37,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 01:30:37,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:30:37,772 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 18 states. [2019-10-15 01:30:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:38,152 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2019-10-15 01:30:38,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:30:38,152 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-10-15 01:30:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:38,153 INFO L225 Difference]: With dead ends: 47 [2019-10-15 01:30:38,153 INFO L226 Difference]: Without dead ends: 32 [2019-10-15 01:30:38,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:30:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-15 01:30:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-15 01:30:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-15 01:30:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-10-15 01:30:38,160 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 25 [2019-10-15 01:30:38,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:38,161 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-15 01:30:38,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-15 01:30:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-10-15 01:30:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:30:38,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:38,162 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:30:38,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:38,363 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:38,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash 93206489, now seen corresponding path program 3 times [2019-10-15 01:30:38,364 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:38,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206766607] [2019-10-15 01:30:38,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:38,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:38,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:38,953 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:30:38,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206766607] [2019-10-15 01:30:38,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871080885] [2019-10-15 01:30:38,954 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:30:39,043 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:39,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:39,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-15 01:30:39,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:39,261 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:30:39,261 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:39,578 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:30:39,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2121638834] [2019-10-15 01:30:39,580 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:30:39,580 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:39,581 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:39,581 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:39,581 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:39,610 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:39,853 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:39,865 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:39,869 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:40,390 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:40,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11, 11] total 33 [2019-10-15 01:30:40,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444259726] [2019-10-15 01:30:40,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-15 01:30:40,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:40,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-15 01:30:40,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2019-10-15 01:30:40,393 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 33 states. [2019-10-15 01:30:41,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:41,326 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2019-10-15 01:30:41,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-15 01:30:41,327 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 31 [2019-10-15 01:30:41,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:41,328 INFO L225 Difference]: With dead ends: 53 [2019-10-15 01:30:41,329 INFO L226 Difference]: Without dead ends: 48 [2019-10-15 01:30:41,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 70 SyntacticMatches, 16 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2019-10-15 01:30:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-15 01:30:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-10-15 01:30:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-15 01:30:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2019-10-15 01:30:41,339 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 31 [2019-10-15 01:30:41,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:41,339 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2019-10-15 01:30:41,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-15 01:30:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2019-10-15 01:30:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:30:41,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:41,341 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:30:41,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:41,544 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:41,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:41,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1870997086, now seen corresponding path program 4 times [2019-10-15 01:30:41,545 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:41,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294945604] [2019-10-15 01:30:41,545 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:41,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:41,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:41,663 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:30:41,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294945604] [2019-10-15 01:30:41,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460812448] [2019-10-15 01:30:41,664 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:30:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:41,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:30:41,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:41,806 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:30:41,806 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:41,864 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:30:41,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [907030824] [2019-10-15 01:30:41,866 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:30:41,866 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:41,866 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:41,867 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:41,867 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:41,900 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:30:42,107 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:42,118 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:42,122 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:42,498 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:42,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 24 [2019-10-15 01:30:42,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754426816] [2019-10-15 01:30:42,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-15 01:30:42,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:42,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-15 01:30:42,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:30:42,502 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand 24 states. [2019-10-15 01:30:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:42,984 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2019-10-15 01:30:42,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-15 01:30:42,985 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-10-15 01:30:42,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:42,989 INFO L225 Difference]: With dead ends: 86 [2019-10-15 01:30:42,989 INFO L226 Difference]: Without dead ends: 47 [2019-10-15 01:30:42,991 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2019-10-15 01:30:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-15 01:30:42,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-15 01:30:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-15 01:30:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2019-10-15 01:30:42,998 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 32 [2019-10-15 01:30:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:42,998 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2019-10-15 01:30:42,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-15 01:30:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2019-10-15 01:30:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:30:43,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:43,000 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:30:43,207 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:43,208 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:43,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:43,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1952369398, now seen corresponding path program 5 times [2019-10-15 01:30:43,209 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:43,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308954140] [2019-10-15 01:30:43,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:43,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:43,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:43,296 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:30:43,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308954140] [2019-10-15 01:30:43,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239718906] [2019-10-15 01:30:43,297 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:30:43,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:30:43,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:43,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:30:43,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:30:43,499 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:30:43,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1636338267] [2019-10-15 01:30:43,572 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:30:43,572 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:43,572 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:43,573 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:43,573 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:43,592 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:43,791 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:43,805 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:43,810 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:44,292 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:44,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 29 [2019-10-15 01:30:44,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849221709] [2019-10-15 01:30:44,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-15 01:30:44,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:44,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-15 01:30:44,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2019-10-15 01:30:44,295 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 29 states. [2019-10-15 01:30:44,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:44,976 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2019-10-15 01:30:44,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:30:44,977 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2019-10-15 01:30:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:44,978 INFO L225 Difference]: With dead ends: 70 [2019-10-15 01:30:44,978 INFO L226 Difference]: Without dead ends: 39 [2019-10-15 01:30:44,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=192, Invalid=1290, Unknown=0, NotChecked=0, Total=1482 [2019-10-15 01:30:44,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-15 01:30:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-15 01:30:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 01:30:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-10-15 01:30:44,986 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 33 [2019-10-15 01:30:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:44,986 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-10-15 01:30:44,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-15 01:30:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-10-15 01:30:44,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 01:30:44,988 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:44,988 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:30:45,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:45,193 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:45,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:45,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1194904952, now seen corresponding path program 6 times [2019-10-15 01:30:45,194 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:45,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116368734] [2019-10-15 01:30:45,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:45,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:45,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:45,843 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 34 [2019-10-15 01:30:45,985 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2019-10-15 01:30:46,121 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2019-10-15 01:30:46,250 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 31 [2019-10-15 01:30:46,402 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 33 [2019-10-15 01:30:46,980 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 31 [2019-10-15 01:30:47,666 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:30:47,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116368734] [2019-10-15 01:30:47,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835210162] [2019-10-15 01:30:47,667 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:30:47,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:47,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:47,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 82 conjunts are in the unsatisfiable core [2019-10-15 01:30:47,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:48,149 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:30:48,149 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:48,772 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 29 [2019-10-15 01:30:48,835 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:30:48,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1546022538] [2019-10-15 01:30:48,837 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:30:48,837 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:48,837 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:48,838 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:48,838 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:48,863 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:30:49,050 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:49,059 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:49,062 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:49,850 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:49,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 13, 13, 11] total 54 [2019-10-15 01:30:49,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650256103] [2019-10-15 01:30:49,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-15 01:30:49,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:49,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-15 01:30:49,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2644, Unknown=0, NotChecked=0, Total=2862 [2019-10-15 01:30:49,854 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 54 states. [2019-10-15 01:30:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:52,264 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-10-15 01:30:52,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-15 01:30:52,264 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 38 [2019-10-15 01:30:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:52,266 INFO L225 Difference]: With dead ends: 65 [2019-10-15 01:30:52,266 INFO L226 Difference]: Without dead ends: 60 [2019-10-15 01:30:52,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 81 SyntacticMatches, 13 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=432, Invalid=4680, Unknown=0, NotChecked=0, Total=5112 [2019-10-15 01:30:52,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-15 01:30:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-10-15 01:30:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-15 01:30:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2019-10-15 01:30:52,276 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 38 [2019-10-15 01:30:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:52,276 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2019-10-15 01:30:52,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-15 01:30:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2019-10-15 01:30:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 01:30:52,278 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:52,278 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:30:52,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:52,482 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:52,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:52,482 INFO L82 PathProgramCache]: Analyzing trace with hash -198646311, now seen corresponding path program 7 times [2019-10-15 01:30:52,483 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:52,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706605308] [2019-10-15 01:30:52,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:52,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:52,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:52,599 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:30:52,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706605308] [2019-10-15 01:30:52,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538543657] [2019-10-15 01:30:52,600 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:30:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:52,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:30:52,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:52,793 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:30:52,793 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:52,850 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:30:52,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1776504492] [2019-10-15 01:30:52,852 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:30:52,852 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:52,853 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:52,853 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:52,853 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:52,877 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:30:53,028 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:53,037 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:53,040 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:53,399 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:53,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 27 [2019-10-15 01:30:53,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992930094] [2019-10-15 01:30:53,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-15 01:30:53,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:53,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-15 01:30:53,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-10-15 01:30:53,402 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 27 states. [2019-10-15 01:30:53,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:53,961 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2019-10-15 01:30:53,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:30:53,962 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 39 [2019-10-15 01:30:53,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:53,963 INFO L225 Difference]: With dead ends: 108 [2019-10-15 01:30:53,963 INFO L226 Difference]: Without dead ends: 58 [2019-10-15 01:30:53,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2019-10-15 01:30:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-15 01:30:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-15 01:30:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-15 01:30:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-10-15 01:30:53,974 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 39 [2019-10-15 01:30:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:53,975 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-10-15 01:30:53,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-15 01:30:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-10-15 01:30:53,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 01:30:53,976 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:53,976 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:30:54,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:54,179 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:54,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:54,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1945727483, now seen corresponding path program 8 times [2019-10-15 01:30:54,180 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:54,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998949416] [2019-10-15 01:30:54,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:54,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:54,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:54,273 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:30:54,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998949416] [2019-10-15 01:30:54,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627840720] [2019-10-15 01:30:54,274 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:30:54,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:30:54,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:54,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:30:54,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:54,480 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:30:54,480 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:54,534 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:30:54,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [923600999] [2019-10-15 01:30:54,536 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:30:54,536 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:54,536 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:54,537 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:54,537 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:54,561 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:30:54,722 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:54,729 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:54,732 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:55,092 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:55,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 27 [2019-10-15 01:30:55,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102147462] [2019-10-15 01:30:55,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-15 01:30:55,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:55,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-15 01:30:55,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-10-15 01:30:55,095 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 27 states. [2019-10-15 01:30:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:55,713 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2019-10-15 01:30:55,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-15 01:30:55,714 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40 [2019-10-15 01:30:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:55,715 INFO L225 Difference]: With dead ends: 85 [2019-10-15 01:30:55,715 INFO L226 Difference]: Without dead ends: 46 [2019-10-15 01:30:55,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 97 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-10-15 01:30:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-15 01:30:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-15 01:30:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-15 01:30:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-10-15 01:30:55,729 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 40 [2019-10-15 01:30:55,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:55,729 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-10-15 01:30:55,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-15 01:30:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-10-15 01:30:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 01:30:55,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:55,730 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:30:55,931 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:55,931 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:55,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:55,932 INFO L82 PathProgramCache]: Analyzing trace with hash 378271609, now seen corresponding path program 9 times [2019-10-15 01:30:55,932 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:55,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84122689] [2019-10-15 01:30:55,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:55,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:55,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:56,552 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 34 [2019-10-15 01:30:56,777 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-10-15 01:30:56,964 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-10-15 01:30:57,145 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 34 [2019-10-15 01:30:57,290 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 31 [2019-10-15 01:30:57,478 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 39 [2019-10-15 01:30:57,623 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2019-10-15 01:30:58,090 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 24 [2019-10-15 01:30:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 1 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:30:58,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84122689] [2019-10-15 01:30:58,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548374585] [2019-10-15 01:30:58,756 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:58,910 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:58,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:58,912 WARN L254 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 106 conjunts are in the unsatisfiable core [2019-10-15 01:30:58,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:30:59,735 INFO L321 TraceCheckSpWp]: Computing backward predicates...