/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_product03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:36:51,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:36:51,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:36:51,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:36:51,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:36:51,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:36:51,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:36:51,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:36:51,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:36:51,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:36:51,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:36:51,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:36:51,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:36:51,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:36:51,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:36:51,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:36:51,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:36:51,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:36:51,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:36:51,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:36:51,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:36:51,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:36:51,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:36:51,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:36:51,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:36:51,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:36:51,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:36:51,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:36:51,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:36:51,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:36:51,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:36:51,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:36:51,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:36:51,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:36:51,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:36:51,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:36:51,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:36:51,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:36:51,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:36:51,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:36:51,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:36:51,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 04:36:52,007 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:36:52,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:36:52,008 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:36:52,008 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:36:52,009 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:36:52,009 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:36:52,009 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:36:52,009 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:36:52,009 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:36:52,010 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:36:52,011 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:36:52,011 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:36:52,011 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:36:52,011 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:36:52,012 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:36:52,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:36:52,014 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:36:52,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:36:52,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:36:52,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:36:52,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:36:52,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:36:52,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:36:52,015 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:36:52,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:36:52,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:36:52,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:36:52,016 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:36:52,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:36:52,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:36:52,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:36:52,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:36:52,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:36:52,018 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:36:52,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:36:52,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:36:52,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:36:52,018 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:36:52,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:36:52,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:36:52,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:36:52,328 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:36:52,328 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:36:52,329 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product03.cil.c [2019-11-24 04:36:52,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9cb1f494/ed9d73e9c4144d058b6c6a46475a2f61/FLAG9654523bc [2019-11-24 04:36:53,071 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:36:53,072 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product03.cil.c [2019-11-24 04:36:53,113 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9cb1f494/ed9d73e9c4144d058b6c6a46475a2f61/FLAG9654523bc [2019-11-24 04:36:53,300 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9cb1f494/ed9d73e9c4144d058b6c6a46475a2f61 [2019-11-24 04:36:53,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:36:53,314 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:36:53,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:36:53,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:36:53,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:36:53,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:36:53" (1/1) ... [2019-11-24 04:36:53,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a899d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:53, skipping insertion in model container [2019-11-24 04:36:53,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:36:53" (1/1) ... [2019-11-24 04:36:53,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:36:53,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:36:54,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:36:54,173 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:36:54,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:36:54,411 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:36:54,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:54 WrapperNode [2019-11-24 04:36:54,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:36:54,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:36:54,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:36:54,413 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:36:54,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:54" (1/1) ... [2019-11-24 04:36:54,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:54" (1/1) ... [2019-11-24 04:36:54,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:36:54,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:36:54,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:36:54,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:36:54,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:54" (1/1) ... [2019-11-24 04:36:54,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:54" (1/1) ... [2019-11-24 04:36:54,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:54" (1/1) ... [2019-11-24 04:36:54,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:54" (1/1) ... [2019-11-24 04:36:54,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:54" (1/1) ... [2019-11-24 04:36:54,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:54" (1/1) ... [2019-11-24 04:36:55,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:54" (1/1) ... [2019-11-24 04:36:55,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:36:55,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:36:55,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:36:55,044 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:36:55,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:54" (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-11-24 04:36:55,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:36:55,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:36:55,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:36:55,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:37:20,961 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:37:20,961 INFO L284 CfgBuilder]: Removed 505 assume(true) statements. [2019-11-24 04:37:20,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:37:20 BoogieIcfgContainer [2019-11-24 04:37:20,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:37:20,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:37:20,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:37:20,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:37:20,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:36:53" (1/3) ... [2019-11-24 04:37:20,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86e8486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:37:20, skipping insertion in model container [2019-11-24 04:37:20,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:54" (2/3) ... [2019-11-24 04:37:20,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86e8486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:37:20, skipping insertion in model container [2019-11-24 04:37:20,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:37:20" (3/3) ... [2019-11-24 04:37:20,971 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product03.cil.c [2019-11-24 04:37:20,980 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:37:20,989 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:37:20,997 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:37:21,026 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:37:21,027 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:37:21,027 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:37:21,027 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:37:21,027 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:37:21,028 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:37:21,028 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:37:21,028 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:37:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2019-11-24 04:37:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:37:21,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:21,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:21,073 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:21,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:21,080 INFO L82 PathProgramCache]: Analyzing trace with hash 381216484, now seen corresponding path program 1 times [2019-11-24 04:37:21,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:21,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133584683] [2019-11-24 04:37:21,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:21,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133584683] [2019-11-24 04:37:21,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:21,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:37:21,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802988191] [2019-11-24 04:37:21,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:37:21,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:21,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:37:21,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:37:21,598 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 2 states. [2019-11-24 04:37:21,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:21,669 INFO L93 Difference]: Finished difference Result 766 states and 1459 transitions. [2019-11-24 04:37:21,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:37:21,670 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-24 04:37:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:21,700 INFO L225 Difference]: With dead ends: 766 [2019-11-24 04:37:21,700 INFO L226 Difference]: Without dead ends: 747 [2019-11-24 04:37:21,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:37:21,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-24 04:37:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-11-24 04:37:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-24 04:37:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1429 transitions. [2019-11-24 04:37:21,835 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1429 transitions. Word has length 14 [2019-11-24 04:37:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:21,835 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1429 transitions. [2019-11-24 04:37:21,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:37:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1429 transitions. [2019-11-24 04:37:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:37:21,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:21,842 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:21,844 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:21,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:21,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1079667128, now seen corresponding path program 1 times [2019-11-24 04:37:21,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:21,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815321636] [2019-11-24 04:37:21,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:22,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815321636] [2019-11-24 04:37:22,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:22,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:22,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991063425] [2019-11-24 04:37:22,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:22,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:22,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:22,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:22,037 INFO L87 Difference]: Start difference. First operand 747 states and 1429 transitions. Second operand 3 states. [2019-11-24 04:37:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:22,152 INFO L93 Difference]: Finished difference Result 1137 states and 2170 transitions. [2019-11-24 04:37:22,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:22,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:37:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:22,159 INFO L225 Difference]: With dead ends: 1137 [2019-11-24 04:37:22,160 INFO L226 Difference]: Without dead ends: 743 [2019-11-24 04:37:22,166 INFO L630 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-11-24 04:37:22,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-11-24 04:37:22,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2019-11-24 04:37:22,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-11-24 04:37:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1421 transitions. [2019-11-24 04:37:22,189 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1421 transitions. Word has length 15 [2019-11-24 04:37:22,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:22,190 INFO L462 AbstractCegarLoop]: Abstraction has 743 states and 1421 transitions. [2019-11-24 04:37:22,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1421 transitions. [2019-11-24 04:37:22,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:37:22,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:22,192 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:22,193 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:22,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:22,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1776471829, now seen corresponding path program 1 times [2019-11-24 04:37:22,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:22,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162350082] [2019-11-24 04:37:22,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:22,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162350082] [2019-11-24 04:37:22,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:22,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:22,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720480588] [2019-11-24 04:37:22,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:22,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:22,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:22,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:22,336 INFO L87 Difference]: Start difference. First operand 743 states and 1421 transitions. Second operand 5 states. [2019-11-24 04:37:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:22,718 INFO L93 Difference]: Finished difference Result 1586 states and 2984 transitions. [2019-11-24 04:37:22,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:37:22,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-24 04:37:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:22,727 INFO L225 Difference]: With dead ends: 1586 [2019-11-24 04:37:22,727 INFO L226 Difference]: Without dead ends: 1206 [2019-11-24 04:37:22,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2019-11-24 04:37:22,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 755. [2019-11-24 04:37:22,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-24 04:37:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1439 transitions. [2019-11-24 04:37:22,760 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1439 transitions. Word has length 17 [2019-11-24 04:37:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:22,760 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1439 transitions. [2019-11-24 04:37:22,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1439 transitions. [2019-11-24 04:37:22,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:37:22,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:22,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:22,762 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:22,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:22,763 INFO L82 PathProgramCache]: Analyzing trace with hash -340618211, now seen corresponding path program 1 times [2019-11-24 04:37:22,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:22,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606964164] [2019-11-24 04:37:22,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:22,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606964164] [2019-11-24 04:37:22,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:22,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:22,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072980095] [2019-11-24 04:37:22,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:22,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:22,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:22,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:22,880 INFO L87 Difference]: Start difference. First operand 755 states and 1439 transitions. Second operand 5 states. [2019-11-24 04:37:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:23,243 INFO L93 Difference]: Finished difference Result 1580 states and 2967 transitions. [2019-11-24 04:37:23,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:37:23,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 04:37:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:23,250 INFO L225 Difference]: With dead ends: 1580 [2019-11-24 04:37:23,251 INFO L226 Difference]: Without dead ends: 1194 [2019-11-24 04:37:23,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:23,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-11-24 04:37:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 761. [2019-11-24 04:37:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-11-24 04:37:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1449 transitions. [2019-11-24 04:37:23,293 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1449 transitions. Word has length 18 [2019-11-24 04:37:23,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:23,293 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1449 transitions. [2019-11-24 04:37:23,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:23,295 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1449 transitions. [2019-11-24 04:37:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:37:23,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:23,296 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:23,296 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:23,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:23,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1487413770, now seen corresponding path program 1 times [2019-11-24 04:37:23,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:23,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374971594] [2019-11-24 04:37:23,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:23,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374971594] [2019-11-24 04:37:23,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:23,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:23,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654832409] [2019-11-24 04:37:23,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:23,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:23,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:23,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:23,418 INFO L87 Difference]: Start difference. First operand 761 states and 1449 transitions. Second operand 5 states. [2019-11-24 04:37:23,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:23,579 INFO L93 Difference]: Finished difference Result 1162 states and 2194 transitions. [2019-11-24 04:37:23,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:23,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 04:37:23,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:23,587 INFO L225 Difference]: With dead ends: 1162 [2019-11-24 04:37:23,587 INFO L226 Difference]: Without dead ends: 1149 [2019-11-24 04:37:23,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2019-11-24 04:37:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 763. [2019-11-24 04:37:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-11-24 04:37:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1451 transitions. [2019-11-24 04:37:23,624 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1451 transitions. Word has length 18 [2019-11-24 04:37:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:23,624 INFO L462 AbstractCegarLoop]: Abstraction has 763 states and 1451 transitions. [2019-11-24 04:37:23,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1451 transitions. [2019-11-24 04:37:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:37:23,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:23,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:23,627 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:23,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:23,628 INFO L82 PathProgramCache]: Analyzing trace with hash -602021852, now seen corresponding path program 1 times [2019-11-24 04:37:23,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:23,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200630359] [2019-11-24 04:37:23,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:23,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200630359] [2019-11-24 04:37:23,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:23,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:23,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193973138] [2019-11-24 04:37:23,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:23,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:23,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:23,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:23,743 INFO L87 Difference]: Start difference. First operand 763 states and 1451 transitions. Second operand 3 states. [2019-11-24 04:37:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:23,792 INFO L93 Difference]: Finished difference Result 776 states and 1463 transitions. [2019-11-24 04:37:23,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:23,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:37:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:23,797 INFO L225 Difference]: With dead ends: 776 [2019-11-24 04:37:23,797 INFO L226 Difference]: Without dead ends: 763 [2019-11-24 04:37:23,798 INFO L630 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-11-24 04:37:23,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-11-24 04:37:23,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 763. [2019-11-24 04:37:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-11-24 04:37:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1450 transitions. [2019-11-24 04:37:23,831 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1450 transitions. Word has length 19 [2019-11-24 04:37:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:23,831 INFO L462 AbstractCegarLoop]: Abstraction has 763 states and 1450 transitions. [2019-11-24 04:37:23,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1450 transitions. [2019-11-24 04:37:23,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:37:23,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:23,837 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:23,838 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:23,838 INFO L82 PathProgramCache]: Analyzing trace with hash 440210112, now seen corresponding path program 1 times [2019-11-24 04:37:23,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:23,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673574258] [2019-11-24 04:37:23,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:24,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:24,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673574258] [2019-11-24 04:37:24,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:24,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:37:24,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84619582] [2019-11-24 04:37:24,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:37:24,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:24,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:37:24,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:24,357 INFO L87 Difference]: Start difference. First operand 763 states and 1450 transitions. Second operand 6 states. [2019-11-24 04:37:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:25,367 INFO L93 Difference]: Finished difference Result 1881 states and 3556 transitions. [2019-11-24 04:37:25,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:37:25,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-24 04:37:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:25,373 INFO L225 Difference]: With dead ends: 1881 [2019-11-24 04:37:25,374 INFO L226 Difference]: Without dead ends: 1024 [2019-11-24 04:37:25,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:37:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2019-11-24 04:37:25,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 763. [2019-11-24 04:37:25,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-11-24 04:37:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1446 transitions. [2019-11-24 04:37:25,429 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1446 transitions. Word has length 20 [2019-11-24 04:37:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:25,429 INFO L462 AbstractCegarLoop]: Abstraction has 763 states and 1446 transitions. [2019-11-24 04:37:25,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:37:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1446 transitions. [2019-11-24 04:37:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:37:25,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:25,431 INFO L410 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] [2019-11-24 04:37:25,431 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:25,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:25,432 INFO L82 PathProgramCache]: Analyzing trace with hash -61260581, now seen corresponding path program 1 times [2019-11-24 04:37:25,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:25,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627082587] [2019-11-24 04:37:25,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:25,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627082587] [2019-11-24 04:37:25,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:25,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:25,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118564015] [2019-11-24 04:37:25,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:25,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:25,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:25,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:25,524 INFO L87 Difference]: Start difference. First operand 763 states and 1446 transitions. Second operand 5 states. [2019-11-24 04:37:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:25,775 INFO L93 Difference]: Finished difference Result 2158 states and 4032 transitions. [2019-11-24 04:37:25,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:37:25,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-24 04:37:25,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:25,786 INFO L225 Difference]: With dead ends: 2158 [2019-11-24 04:37:25,787 INFO L226 Difference]: Without dead ends: 1660 [2019-11-24 04:37:25,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:37:25,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2019-11-24 04:37:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 984. [2019-11-24 04:37:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-11-24 04:37:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1864 transitions. [2019-11-24 04:37:25,936 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1864 transitions. Word has length 23 [2019-11-24 04:37:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:25,937 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1864 transitions. [2019-11-24 04:37:25,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1864 transitions. [2019-11-24 04:37:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:37:25,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:25,938 INFO L410 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] [2019-11-24 04:37:25,938 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:25,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:25,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1915622935, now seen corresponding path program 1 times [2019-11-24 04:37:25,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:25,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307351870] [2019-11-24 04:37:25,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:26,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307351870] [2019-11-24 04:37:26,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:26,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:37:26,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045420803] [2019-11-24 04:37:26,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:26,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:26,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:26,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:26,039 INFO L87 Difference]: Start difference. First operand 984 states and 1864 transitions. Second operand 5 states. [2019-11-24 04:37:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:26,397 INFO L93 Difference]: Finished difference Result 1749 states and 3237 transitions. [2019-11-24 04:37:26,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:37:26,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-24 04:37:26,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:26,406 INFO L225 Difference]: With dead ends: 1749 [2019-11-24 04:37:26,407 INFO L226 Difference]: Without dead ends: 1345 [2019-11-24 04:37:26,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:37:26,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2019-11-24 04:37:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 990. [2019-11-24 04:37:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2019-11-24 04:37:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1870 transitions. [2019-11-24 04:37:26,480 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1870 transitions. Word has length 23 [2019-11-24 04:37:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:26,480 INFO L462 AbstractCegarLoop]: Abstraction has 990 states and 1870 transitions. [2019-11-24 04:37:26,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1870 transitions. [2019-11-24 04:37:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:37:26,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:26,482 INFO L410 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, 1, 1] [2019-11-24 04:37:26,482 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:26,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:26,483 INFO L82 PathProgramCache]: Analyzing trace with hash -491680541, now seen corresponding path program 1 times [2019-11-24 04:37:26,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:26,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112695815] [2019-11-24 04:37:26,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:26,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112695815] [2019-11-24 04:37:26,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:26,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:37:26,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946925164] [2019-11-24 04:37:26,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:26,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:26,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:26,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:26,568 INFO L87 Difference]: Start difference. First operand 990 states and 1870 transitions. Second operand 3 states. [2019-11-24 04:37:26,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:26,959 INFO L93 Difference]: Finished difference Result 1527 states and 2856 transitions. [2019-11-24 04:37:26,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:26,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-24 04:37:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:26,966 INFO L225 Difference]: With dead ends: 1527 [2019-11-24 04:37:26,966 INFO L226 Difference]: Without dead ends: 1028 [2019-11-24 04:37:26,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-11-24 04:37:27,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1010. [2019-11-24 04:37:27,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2019-11-24 04:37:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1866 transitions. [2019-11-24 04:37:27,039 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1866 transitions. Word has length 26 [2019-11-24 04:37:27,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:27,039 INFO L462 AbstractCegarLoop]: Abstraction has 1010 states and 1866 transitions. [2019-11-24 04:37:27,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:27,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1866 transitions. [2019-11-24 04:37:27,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:37:27,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:27,040 INFO L410 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, 1, 1, 1, 1] [2019-11-24 04:37:27,041 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:27,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:27,041 INFO L82 PathProgramCache]: Analyzing trace with hash -674787822, now seen corresponding path program 1 times [2019-11-24 04:37:27,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:27,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229717014] [2019-11-24 04:37:27,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:27,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229717014] [2019-11-24 04:37:27,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:27,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:27,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967490898] [2019-11-24 04:37:27,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:27,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:27,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:27,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:27,146 INFO L87 Difference]: Start difference. First operand 1010 states and 1866 transitions. Second operand 5 states. [2019-11-24 04:37:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:27,324 INFO L93 Difference]: Finished difference Result 2017 states and 3700 transitions. [2019-11-24 04:37:27,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:37:27,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-24 04:37:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:27,335 INFO L225 Difference]: With dead ends: 2017 [2019-11-24 04:37:27,335 INFO L226 Difference]: Without dead ends: 1555 [2019-11-24 04:37:27,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:37:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-11-24 04:37:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 990. [2019-11-24 04:37:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2019-11-24 04:37:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1830 transitions. [2019-11-24 04:37:27,402 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1830 transitions. Word has length 28 [2019-11-24 04:37:27,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:27,402 INFO L462 AbstractCegarLoop]: Abstraction has 990 states and 1830 transitions. [2019-11-24 04:37:27,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1830 transitions. [2019-11-24 04:37:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:37:27,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:27,404 INFO L410 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, 1, 1, 1, 1] [2019-11-24 04:37:27,404 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:27,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:27,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1643231032, now seen corresponding path program 1 times [2019-11-24 04:37:27,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:27,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202456307] [2019-11-24 04:37:27,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:27,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202456307] [2019-11-24 04:37:27,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:27,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:37:27,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707285393] [2019-11-24 04:37:27,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:37:27,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:27,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:37:27,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:27,624 INFO L87 Difference]: Start difference. First operand 990 states and 1830 transitions. Second operand 6 states. [2019-11-24 04:37:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:28,259 INFO L93 Difference]: Finished difference Result 1650 states and 3019 transitions. [2019-11-24 04:37:28,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:37:28,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-24 04:37:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:28,267 INFO L225 Difference]: With dead ends: 1650 [2019-11-24 04:37:28,267 INFO L226 Difference]: Without dead ends: 1230 [2019-11-24 04:37:28,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:37:28,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-11-24 04:37:28,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1165. [2019-11-24 04:37:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2019-11-24 04:37:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 2140 transitions. [2019-11-24 04:37:28,346 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 2140 transitions. Word has length 28 [2019-11-24 04:37:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:28,346 INFO L462 AbstractCegarLoop]: Abstraction has 1165 states and 2140 transitions. [2019-11-24 04:37:28,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:37:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 2140 transitions. [2019-11-24 04:37:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 04:37:28,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:28,348 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:28,348 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:28,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:28,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1797897830, now seen corresponding path program 1 times [2019-11-24 04:37:28,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:28,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354243293] [2019-11-24 04:37:28,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:28,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354243293] [2019-11-24 04:37:28,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:28,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:28,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284945130] [2019-11-24 04:37:28,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:28,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:28,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:28,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:28,504 INFO L87 Difference]: Start difference. First operand 1165 states and 2140 transitions. Second operand 3 states. [2019-11-24 04:37:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:29,535 INFO L93 Difference]: Finished difference Result 2268 states and 4133 transitions. [2019-11-24 04:37:29,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:29,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 04:37:29,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:29,543 INFO L225 Difference]: With dead ends: 2268 [2019-11-24 04:37:29,544 INFO L226 Difference]: Without dead ends: 1387 [2019-11-24 04:37:29,545 INFO L630 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-11-24 04:37:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2019-11-24 04:37:29,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1105. [2019-11-24 04:37:29,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105 states. [2019-11-24 04:37:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1990 transitions. [2019-11-24 04:37:29,624 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1990 transitions. Word has length 34 [2019-11-24 04:37:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:29,624 INFO L462 AbstractCegarLoop]: Abstraction has 1105 states and 1990 transitions. [2019-11-24 04:37:29,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1990 transitions. [2019-11-24 04:37:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:37:29,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:29,626 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:29,626 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:29,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:29,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1838844269, now seen corresponding path program 1 times [2019-11-24 04:37:29,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:29,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268608522] [2019-11-24 04:37:29,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:29,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268608522] [2019-11-24 04:37:29,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:29,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:29,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518759184] [2019-11-24 04:37:29,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:29,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:29,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:29,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:29,785 INFO L87 Difference]: Start difference. First operand 1105 states and 1990 transitions. Second operand 3 states. [2019-11-24 04:37:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:30,608 INFO L93 Difference]: Finished difference Result 2138 states and 3828 transitions. [2019-11-24 04:37:30,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:30,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 04:37:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:30,615 INFO L225 Difference]: With dead ends: 2138 [2019-11-24 04:37:30,615 INFO L226 Difference]: Without dead ends: 1339 [2019-11-24 04:37:30,617 INFO L630 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-11-24 04:37:30,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-11-24 04:37:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1060. [2019-11-24 04:37:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-11-24 04:37:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1855 transitions. [2019-11-24 04:37:30,697 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1855 transitions. Word has length 35 [2019-11-24 04:37:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:30,697 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 1855 transitions. [2019-11-24 04:37:30,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:30,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1855 transitions. [2019-11-24 04:37:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:37:30,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:30,698 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:30,699 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:30,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:30,699 INFO L82 PathProgramCache]: Analyzing trace with hash 465800008, now seen corresponding path program 1 times [2019-11-24 04:37:30,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:30,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615676096] [2019-11-24 04:37:30,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:30,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615676096] [2019-11-24 04:37:30,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:30,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:30,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512623087] [2019-11-24 04:37:30,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:30,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:30,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:30,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:30,870 INFO L87 Difference]: Start difference. First operand 1060 states and 1855 transitions. Second operand 3 states. [2019-11-24 04:37:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:31,625 INFO L93 Difference]: Finished difference Result 2033 states and 3548 transitions. [2019-11-24 04:37:31,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:31,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 04:37:31,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:31,631 INFO L225 Difference]: With dead ends: 2033 [2019-11-24 04:37:31,631 INFO L226 Difference]: Without dead ends: 1306 [2019-11-24 04:37:31,635 INFO L630 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-11-24 04:37:31,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-11-24 04:37:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1030. [2019-11-24 04:37:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2019-11-24 04:37:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1735 transitions. [2019-11-24 04:37:31,713 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1735 transitions. Word has length 37 [2019-11-24 04:37:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:31,713 INFO L462 AbstractCegarLoop]: Abstraction has 1030 states and 1735 transitions. [2019-11-24 04:37:31,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1735 transitions. [2019-11-24 04:37:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 04:37:31,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:31,715 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:31,715 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:31,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:31,715 INFO L82 PathProgramCache]: Analyzing trace with hash -131771866, now seen corresponding path program 1 times [2019-11-24 04:37:31,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:31,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305221530] [2019-11-24 04:37:31,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:31,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:31,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305221530] [2019-11-24 04:37:31,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:31,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:31,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22970573] [2019-11-24 04:37:31,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:31,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:31,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:31,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:31,891 INFO L87 Difference]: Start difference. First operand 1030 states and 1735 transitions. Second operand 3 states. [2019-11-24 04:37:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:32,712 INFO L93 Difference]: Finished difference Result 1953 states and 3293 transitions. [2019-11-24 04:37:32,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:32,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-24 04:37:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:32,717 INFO L225 Difference]: With dead ends: 1953 [2019-11-24 04:37:32,717 INFO L226 Difference]: Without dead ends: 1288 [2019-11-24 04:37:32,719 INFO L630 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-11-24 04:37:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2019-11-24 04:37:32,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1015. [2019-11-24 04:37:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-11-24 04:37:32,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1630 transitions. [2019-11-24 04:37:32,798 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1630 transitions. Word has length 40 [2019-11-24 04:37:32,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:32,798 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1630 transitions. [2019-11-24 04:37:32,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:32,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1630 transitions. [2019-11-24 04:37:32,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 04:37:32,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:32,800 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:32,800 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:32,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:32,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2102672348, now seen corresponding path program 1 times [2019-11-24 04:37:32,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:32,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708388005] [2019-11-24 04:37:32,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:32,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708388005] [2019-11-24 04:37:32,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:32,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:32,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049365619] [2019-11-24 04:37:32,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:32,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:32,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:32,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:32,961 INFO L87 Difference]: Start difference. First operand 1015 states and 1630 transitions. Second operand 3 states. [2019-11-24 04:37:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:33,731 INFO L93 Difference]: Finished difference Result 1644 states and 2623 transitions. [2019-11-24 04:37:33,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:33,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-24 04:37:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:33,736 INFO L225 Difference]: With dead ends: 1644 [2019-11-24 04:37:33,736 INFO L226 Difference]: Without dead ends: 1031 [2019-11-24 04:37:33,738 INFO L630 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-11-24 04:37:33,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2019-11-24 04:37:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1015. [2019-11-24 04:37:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-11-24 04:37:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1540 transitions. [2019-11-24 04:37:33,821 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1540 transitions. Word has length 44 [2019-11-24 04:37:33,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:33,821 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1540 transitions. [2019-11-24 04:37:33,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1540 transitions. [2019-11-24 04:37:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:37:33,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:33,823 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:33,823 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:33,824 INFO L82 PathProgramCache]: Analyzing trace with hash 181197151, now seen corresponding path program 1 times [2019-11-24 04:37:33,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:33,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602865038] [2019-11-24 04:37:33,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:33,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602865038] [2019-11-24 04:37:33,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641138249] [2019-11-24 04:37:33,967 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-11-24 04:37:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:34,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 04:37:34,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:37:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:34,392 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:37:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:34,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2071400910] [2019-11-24 04:37:34,497 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2019-11-24 04:37:34,498 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:37:34,504 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:37:34,511 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:37:34,512 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 04:38:14,915 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 772