/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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hid--hid-roccat-pyra.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 03:34:00,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 03:34:00,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 03:34:00,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 03:34:00,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 03:34:00,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 03:34:00,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 03:34:00,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 03:34:00,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 03:34:00,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 03:34:00,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 03:34:00,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 03:34:00,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 03:34:00,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 03:34:00,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 03:34:00,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 03:34:00,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 03:34:00,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 03:34:00,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 03:34:00,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 03:34:00,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 03:34:00,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 03:34:00,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 03:34:00,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 03:34:00,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 03:34:00,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 03:34:00,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 03:34:00,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 03:34:00,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 03:34:00,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 03:34:00,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 03:34:00,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 03:34:00,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 03:34:00,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 03:34:00,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 03:34:00,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 03:34:00,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 03:34:00,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 03:34:00,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 03:34:00,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 03:34:00,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 03:34:00,646 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 03:34:00,682 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 03:34:00,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 03:34:00,683 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 03:34:00,683 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 03:34:00,683 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 03:34:00,687 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 03:34:00,687 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 03:34:00,687 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 03:34:00,687 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 03:34:00,688 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 03:34:00,688 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 03:34:00,688 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 03:34:00,688 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 03:34:00,688 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 03:34:00,689 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 03:34:00,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 03:34:00,689 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 03:34:00,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 03:34:00,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 03:34:00,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 03:34:00,693 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 03:34:00,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 03:34:00,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 03:34:00,694 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 03:34:00,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 03:34:00,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 03:34:00,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 03:34:00,695 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 03:34:00,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 03:34:00,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 03:34:00,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 03:34:00,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 03:34:00,696 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 03:34:00,696 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 03:34:00,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 03:34:00,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 03:34:00,697 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 03:34:00,697 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 03:34:00,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 03:34:00,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 03:34:00,996 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 03:34:00,998 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 03:34:00,998 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 03:34:00,999 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hid--hid-roccat-pyra.ko-entry_point.cil.out.i [2019-11-24 03:34:01,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a87f689/d326137759f14618bb2e82cb8c69907e/FLAGe771e9994 [2019-11-24 03:34:01,880 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 03:34:01,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hid--hid-roccat-pyra.ko-entry_point.cil.out.i [2019-11-24 03:34:01,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a87f689/d326137759f14618bb2e82cb8c69907e/FLAGe771e9994 [2019-11-24 03:34:02,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a87f689/d326137759f14618bb2e82cb8c69907e [2019-11-24 03:34:02,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 03:34:02,407 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 03:34:02,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 03:34:02,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 03:34:02,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 03:34:02,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:34:02" (1/1) ... [2019-11-24 03:34:02,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a17a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:34:02, skipping insertion in model container [2019-11-24 03:34:02,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:34:02" (1/1) ... [2019-11-24 03:34:02,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 03:34:02,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 03:34:04,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:34:04,614 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 03:34:04,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:34:05,239 INFO L208 MainTranslator]: Completed translation [2019-11-24 03:34:05,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:34:05 WrapperNode [2019-11-24 03:34:05,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 03:34:05,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 03:34:05,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 03:34:05,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 03:34:05,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:34:05" (1/1) ... [2019-11-24 03:34:05,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:34:05" (1/1) ... [2019-11-24 03:34:05,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 03:34:05,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 03:34:05,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 03:34:05,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 03:34:05,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:34:05" (1/1) ... [2019-11-24 03:34:05,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:34:05" (1/1) ... [2019-11-24 03:34:05,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:34:05" (1/1) ... [2019-11-24 03:34:05,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:34:05" (1/1) ... [2019-11-24 03:34:05,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:34:05" (1/1) ... [2019-11-24 03:34:05,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:34:05" (1/1) ... [2019-11-24 03:34:05,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:34:05" (1/1) ... [2019-11-24 03:34:06,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 03:34:06,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 03:34:06,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 03:34:06,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 03:34:06,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:34:05" (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 03:34:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure hid_hw_stop [2019-11-24 03:34:06,167 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_hw_stop [2019-11-24 03:34:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 03:34:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 03:34:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 03:34:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 03:34:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 03:34:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 03:34:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 03:34:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 03:34:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-24 03:34:06,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-24 03:34:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure pyra_remove [2019-11-24 03:34:06,170 INFO L138 BoogieDeclarations]: Found implementation of procedure pyra_remove [2019-11-24 03:34:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 03:34:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 03:34:06,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 03:34:41,075 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 03:34:41,076 INFO L284 CfgBuilder]: Removed 1435 assume(true) statements. [2019-11-24 03:34:41,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:34:41 BoogieIcfgContainer [2019-11-24 03:34:41,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 03:34:41,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 03:34:41,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 03:34:41,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 03:34:41,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 03:34:02" (1/3) ... [2019-11-24 03:34:41,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2d5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:34:41, skipping insertion in model container [2019-11-24 03:34:41,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:34:05" (2/3) ... [2019-11-24 03:34:41,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2d5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:34:41, skipping insertion in model container [2019-11-24 03:34:41,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:34:41" (3/3) ... [2019-11-24 03:34:41,086 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--hid--hid-roccat-pyra.ko-entry_point.cil.out.i [2019-11-24 03:34:41,097 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 03:34:41,109 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2019-11-24 03:34:41,120 INFO L249 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2019-11-24 03:34:41,155 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 03:34:41,155 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 03:34:41,155 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 03:34:41,155 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 03:34:41,155 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 03:34:41,156 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 03:34:41,156 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 03:34:41,156 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 03:34:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states. [2019-11-24 03:34:41,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-24 03:34:41,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:34:41,213 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:34:41,213 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:34:41,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:34:41,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1828378420, now seen corresponding path program 1 times [2019-11-24 03:34:41,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:34:41,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129509822] [2019-11-24 03:34:41,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:34:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:34:42,472 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 03:34:42,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129509822] [2019-11-24 03:34:42,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:34:42,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:34:42,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479475532] [2019-11-24 03:34:42,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:34:42,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:34:42,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:34:42,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:34:42,499 INFO L87 Difference]: Start difference. First operand 581 states. Second operand 3 states. [2019-11-24 03:34:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:34:42,876 INFO L93 Difference]: Finished difference Result 1508 states and 2382 transitions. [2019-11-24 03:34:42,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:34:42,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-24 03:34:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:34:42,902 INFO L225 Difference]: With dead ends: 1508 [2019-11-24 03:34:42,902 INFO L226 Difference]: Without dead ends: 966 [2019-11-24 03:34:42,909 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 03:34:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-11-24 03:34:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 859. [2019-11-24 03:34:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-24 03:34:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1359 transitions. [2019-11-24 03:34:43,005 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1359 transitions. Word has length 106 [2019-11-24 03:34:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:34:43,006 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1359 transitions. [2019-11-24 03:34:43,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:34:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1359 transitions. [2019-11-24 03:34:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-24 03:34:43,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:34:43,009 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:34:43,010 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:34:43,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:34:43,011 INFO L82 PathProgramCache]: Analyzing trace with hash 478557637, now seen corresponding path program 1 times [2019-11-24 03:34:43,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:34:43,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296300655] [2019-11-24 03:34:43,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:34:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:34:43,615 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 03:34:43,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296300655] [2019-11-24 03:34:43,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:34:43,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:34:43,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703819190] [2019-11-24 03:34:43,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:34:43,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:34:43,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:34:43,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:34:43,620 INFO L87 Difference]: Start difference. First operand 859 states and 1359 transitions. Second operand 3 states. [2019-11-24 03:34:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:34:43,885 INFO L93 Difference]: Finished difference Result 2335 states and 3621 transitions. [2019-11-24 03:34:43,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:34:43,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-24 03:34:43,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:34:43,896 INFO L225 Difference]: With dead ends: 2335 [2019-11-24 03:34:43,897 INFO L226 Difference]: Without dead ends: 1572 [2019-11-24 03:34:43,901 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 03:34:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2019-11-24 03:34:43,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1471. [2019-11-24 03:34:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-11-24 03:34:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2385 transitions. [2019-11-24 03:34:43,957 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2385 transitions. Word has length 106 [2019-11-24 03:34:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:34:43,959 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2385 transitions. [2019-11-24 03:34:43,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:34:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2385 transitions. [2019-11-24 03:34:43,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-24 03:34:43,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:34:43,968 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:34:43,969 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:34:43,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:34:43,970 INFO L82 PathProgramCache]: Analyzing trace with hash -2047585035, now seen corresponding path program 1 times [2019-11-24 03:34:43,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:34:43,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612885348] [2019-11-24 03:34:43,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:34:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:34:44,709 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 03:34:44,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612885348] [2019-11-24 03:34:44,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:34:44,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:34:44,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273203608] [2019-11-24 03:34:44,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:34:44,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:34:44,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:34:44,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:34:44,713 INFO L87 Difference]: Start difference. First operand 1471 states and 2385 transitions. Second operand 3 states. [2019-11-24 03:34:45,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:34:45,028 INFO L93 Difference]: Finished difference Result 4187 states and 6723 transitions. [2019-11-24 03:34:45,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:34:45,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-24 03:34:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:34:45,047 INFO L225 Difference]: With dead ends: 4187 [2019-11-24 03:34:45,047 INFO L226 Difference]: Without dead ends: 2812 [2019-11-24 03:34:45,050 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 03:34:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2019-11-24 03:34:45,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2707. [2019-11-24 03:34:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2707 states. [2019-11-24 03:34:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2707 states to 2707 states and 4457 transitions. [2019-11-24 03:34:45,154 INFO L78 Accepts]: Start accepts. Automaton has 2707 states and 4457 transitions. Word has length 106 [2019-11-24 03:34:45,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:34:45,156 INFO L462 AbstractCegarLoop]: Abstraction has 2707 states and 4457 transitions. [2019-11-24 03:34:45,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:34:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2707 states and 4457 transitions. [2019-11-24 03:34:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-24 03:34:45,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:34:45,158 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:34:45,160 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:34:45,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:34:45,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1613096752, now seen corresponding path program 1 times [2019-11-24 03:34:45,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:34:45,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011707391] [2019-11-24 03:34:45,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:34:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:34:45,618 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 03:34:45,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011707391] [2019-11-24 03:34:45,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:34:45,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:34:45,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461416659] [2019-11-24 03:34:45,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:34:45,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:34:45,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:34:45,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:34:45,620 INFO L87 Difference]: Start difference. First operand 2707 states and 4457 transitions. Second operand 3 states. [2019-11-24 03:34:45,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:34:45,971 INFO L93 Difference]: Finished difference Result 7813 states and 12803 transitions. [2019-11-24 03:34:45,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:34:45,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-24 03:34:45,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:34:46,000 INFO L225 Difference]: With dead ends: 7813 [2019-11-24 03:34:46,001 INFO L226 Difference]: Without dead ends: 5202 [2019-11-24 03:34:46,007 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 03:34:46,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5202 states. [2019-11-24 03:34:46,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5202 to 5095. [2019-11-24 03:34:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5095 states. [2019-11-24 03:34:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 8457 transitions. [2019-11-24 03:34:46,212 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 8457 transitions. Word has length 107 [2019-11-24 03:34:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:34:46,213 INFO L462 AbstractCegarLoop]: Abstraction has 5095 states and 8457 transitions. [2019-11-24 03:34:46,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:34:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 8457 transitions. [2019-11-24 03:34:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-24 03:34:46,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:34:46,216 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:34:46,216 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:34:46,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:34:46,217 INFO L82 PathProgramCache]: Analyzing trace with hash -535581820, now seen corresponding path program 1 times [2019-11-24 03:34:46,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:34:46,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371840361] [2019-11-24 03:34:46,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:34:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:34:46,765 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 03:34:46,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371840361] [2019-11-24 03:34:46,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:34:46,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:34:46,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017981342] [2019-11-24 03:34:46,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:34:46,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:34:46,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:34:46,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:34:46,768 INFO L87 Difference]: Start difference. First operand 5095 states and 8457 transitions. Second operand 3 states. [2019-11-24 03:34:47,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:34:47,371 INFO L93 Difference]: Finished difference Result 14760 states and 24447 transitions. [2019-11-24 03:34:47,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:34:47,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-24 03:34:47,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:34:47,424 INFO L225 Difference]: With dead ends: 14760 [2019-11-24 03:34:47,425 INFO L226 Difference]: Without dead ends: 9761 [2019-11-24 03:34:47,432 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 03:34:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9761 states. [2019-11-24 03:34:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9761 to 9663. [2019-11-24 03:34:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9663 states. [2019-11-24 03:34:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9663 states to 9663 states and 16105 transitions. [2019-11-24 03:34:47,761 INFO L78 Accepts]: Start accepts. Automaton has 9663 states and 16105 transitions. Word has length 109 [2019-11-24 03:34:47,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:34:47,762 INFO L462 AbstractCegarLoop]: Abstraction has 9663 states and 16105 transitions. [2019-11-24 03:34:47,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:34:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 9663 states and 16105 transitions. [2019-11-24 03:34:47,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-24 03:34:47,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:34:47,763 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:34:47,765 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:34:47,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:34:47,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1253567600, now seen corresponding path program 1 times [2019-11-24 03:34:47,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:34:47,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965243466] [2019-11-24 03:34:47,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:34:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:34:48,201 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 03:34:48,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965243466] [2019-11-24 03:34:48,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:34:48,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:34:48,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118237124] [2019-11-24 03:34:48,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:34:48,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:34:48,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:34:48,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:34:48,204 INFO L87 Difference]: Start difference. First operand 9663 states and 16105 transitions. Second operand 3 states. [2019-11-24 03:34:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:34:50,859 INFO L93 Difference]: Finished difference Result 28713 states and 47778 transitions. [2019-11-24 03:34:50,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:34:50,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-24 03:34:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:34:50,942 INFO L225 Difference]: With dead ends: 28713 [2019-11-24 03:34:50,943 INFO L226 Difference]: Without dead ends: 19146 [2019-11-24 03:34:50,961 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 03:34:50,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19146 states. [2019-11-24 03:34:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19146 to 19056. [2019-11-24 03:34:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19056 states. [2019-11-24 03:34:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19056 states to 19056 states and 31723 transitions. [2019-11-24 03:34:51,963 INFO L78 Accepts]: Start accepts. Automaton has 19056 states and 31723 transitions. Word has length 109 [2019-11-24 03:34:51,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:34:51,964 INFO L462 AbstractCegarLoop]: Abstraction has 19056 states and 31723 transitions. [2019-11-24 03:34:51,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:34:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 19056 states and 31723 transitions. [2019-11-24 03:34:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-24 03:34:51,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:34:51,966 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, 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, 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 03:34:51,967 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:34:51,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:34:51,967 INFO L82 PathProgramCache]: Analyzing trace with hash 910382148, now seen corresponding path program 1 times [2019-11-24 03:34:51,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:34:51,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574483164] [2019-11-24 03:34:51,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:34:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:34:52,555 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 03:34:52,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574483164] [2019-11-24 03:34:52,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:34:52,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:34:52,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596910901] [2019-11-24 03:34:52,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:34:52,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:34:52,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:34:52,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:34:52,561 INFO L87 Difference]: Start difference. First operand 19056 states and 31723 transitions. Second operand 3 states. [2019-11-24 03:34:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:34:52,913 INFO L93 Difference]: Finished difference Result 19056 states and 31723 transitions. [2019-11-24 03:34:52,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:34:52,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-24 03:34:52,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:34:52,968 INFO L225 Difference]: With dead ends: 19056 [2019-11-24 03:34:52,969 INFO L226 Difference]: Without dead ends: 19054 [2019-11-24 03:34:52,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 03:34:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19054 states. [2019-11-24 03:34:54,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19054 to 19054. [2019-11-24 03:34:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19054 states. [2019-11-24 03:34:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19054 states to 19054 states and 31721 transitions. [2019-11-24 03:34:54,939 INFO L78 Accepts]: Start accepts. Automaton has 19054 states and 31721 transitions. Word has length 112 [2019-11-24 03:34:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:34:54,940 INFO L462 AbstractCegarLoop]: Abstraction has 19054 states and 31721 transitions. [2019-11-24 03:34:54,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:34:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 19054 states and 31721 transitions. [2019-11-24 03:34:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-24 03:34:54,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:34:54,943 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, 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, 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 03:34:54,945 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:34:54,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:34:54,945 INFO L82 PathProgramCache]: Analyzing trace with hash -840723849, now seen corresponding path program 1 times [2019-11-24 03:34:54,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:34:54,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977170986] [2019-11-24 03:34:54,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:34:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:34:55,374 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 03:34:55,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977170986] [2019-11-24 03:34:55,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:34:55,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:34:55,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629982141] [2019-11-24 03:34:55,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:34:55,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:34:55,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:34:55,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:34:55,376 INFO L87 Difference]: Start difference. First operand 19054 states and 31721 transitions. Second operand 3 states. [2019-11-24 03:34:56,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:34:56,564 INFO L93 Difference]: Finished difference Result 56064 states and 93295 transitions. [2019-11-24 03:34:56,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:34:56,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-24 03:34:56,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:34:56,671 INFO L225 Difference]: With dead ends: 56064 [2019-11-24 03:34:56,671 INFO L226 Difference]: Without dead ends: 37106 [2019-11-24 03:34:56,702 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 03:34:56,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37106 states. [2019-11-24 03:34:57,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37106 to 37006. [2019-11-24 03:34:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37006 states. [2019-11-24 03:34:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37006 states to 37006 states and 61641 transitions. [2019-11-24 03:34:57,987 INFO L78 Accepts]: Start accepts. Automaton has 37006 states and 61641 transitions. Word has length 113 [2019-11-24 03:34:57,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:34:57,988 INFO L462 AbstractCegarLoop]: Abstraction has 37006 states and 61641 transitions. [2019-11-24 03:34:57,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:34:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 37006 states and 61641 transitions. [2019-11-24 03:34:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-24 03:34:57,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:34:57,989 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, 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, 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 03:34:57,990 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:34:57,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:34:57,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1123456067, now seen corresponding path program 1 times [2019-11-24 03:34:57,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:34:57,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703468826] [2019-11-24 03:34:57,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:34:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:34:58,367 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 03:34:58,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703468826] [2019-11-24 03:34:58,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:34:58,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:34:58,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73580383] [2019-11-24 03:34:58,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:34:58,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:34:58,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:34:58,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:34:58,375 INFO L87 Difference]: Start difference. First operand 37006 states and 61641 transitions. Second operand 3 states. [2019-11-24 03:35:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:35:01,059 INFO L93 Difference]: Finished difference Result 109918 states and 183115 transitions. [2019-11-24 03:35:01,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:35:01,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-24 03:35:01,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:35:01,275 INFO L225 Difference]: With dead ends: 109918 [2019-11-24 03:35:01,275 INFO L226 Difference]: Without dead ends: 73008 [2019-11-24 03:35:01,326 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 03:35:01,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73008 states. [2019-11-24 03:35:02,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73008 to 72910. [2019-11-24 03:35:02,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72910 states. [2019-11-24 03:35:03,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72910 states to 72910 states and 121481 transitions. [2019-11-24 03:35:03,093 INFO L78 Accepts]: Start accepts. Automaton has 72910 states and 121481 transitions. Word has length 113 [2019-11-24 03:35:03,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:35:03,094 INFO L462 AbstractCegarLoop]: Abstraction has 72910 states and 121481 transitions. [2019-11-24 03:35:03,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:35:03,094 INFO L276 IsEmpty]: Start isEmpty. Operand 72910 states and 121481 transitions. [2019-11-24 03:35:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-24 03:35:03,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:35:03,096 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, 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, 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 03:35:03,096 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:35:03,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:35:03,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1842914265, now seen corresponding path program 1 times [2019-11-24 03:35:03,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:35:03,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958135474] [2019-11-24 03:35:03,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:35:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:35:03,535 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 03:35:03,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958135474] [2019-11-24 03:35:03,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:35:03,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:35:03,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950696866] [2019-11-24 03:35:03,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:35:03,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:35:03,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:35:03,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:35:03,539 INFO L87 Difference]: Start difference. First operand 72910 states and 121481 transitions. Second operand 3 states. [2019-11-24 03:35:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:35:04,944 INFO L93 Difference]: Finished difference Result 72910 states and 121481 transitions. [2019-11-24 03:35:04,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:35:04,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-24 03:35:04,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:35:05,080 INFO L225 Difference]: With dead ends: 72910 [2019-11-24 03:35:05,080 INFO L226 Difference]: Without dead ends: 72908 [2019-11-24 03:35:05,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 03:35:05,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72908 states. [2019-11-24 03:35:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72908 to 72908. [2019-11-24 03:35:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72908 states. [2019-11-24 03:35:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72908 states to 72908 states and 121479 transitions. [2019-11-24 03:35:08,464 INFO L78 Accepts]: Start accepts. Automaton has 72908 states and 121479 transitions. Word has length 113 [2019-11-24 03:35:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:35:08,465 INFO L462 AbstractCegarLoop]: Abstraction has 72908 states and 121479 transitions. [2019-11-24 03:35:08,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:35:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 72908 states and 121479 transitions. [2019-11-24 03:35:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-24 03:35:08,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:35:08,466 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, 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, 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 03:35:08,467 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:35:08,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:35:08,467 INFO L82 PathProgramCache]: Analyzing trace with hash -249727809, now seen corresponding path program 1 times [2019-11-24 03:35:08,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:35:08,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140785522] [2019-11-24 03:35:08,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:35:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:35:08,837 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 03:35:08,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140785522] [2019-11-24 03:35:08,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:35:08,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:35:08,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704077967] [2019-11-24 03:35:08,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:35:08,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:35:08,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:35:08,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:35:08,840 INFO L87 Difference]: Start difference. First operand 72908 states and 121479 transitions. Second operand 3 states. [2019-11-24 03:35:13,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:35:13,289 INFO L93 Difference]: Finished difference Result 214938 states and 358153 transitions. [2019-11-24 03:35:13,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:35:13,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-11-24 03:35:13,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:35:13,499 INFO L225 Difference]: With dead ends: 214938 [2019-11-24 03:35:13,500 INFO L226 Difference]: Without dead ends: 142126 [2019-11-24 03:35:13,584 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 03:35:13,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142126 states. [2019-11-24 03:35:16,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142126 to 142028. [2019-11-24 03:35:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142028 states. [2019-11-24 03:35:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142028 states to 142028 states and 236551 transitions. [2019-11-24 03:35:16,723 INFO L78 Accepts]: Start accepts. Automaton has 142028 states and 236551 transitions. Word has length 114 [2019-11-24 03:35:16,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:35:16,723 INFO L462 AbstractCegarLoop]: Abstraction has 142028 states and 236551 transitions. [2019-11-24 03:35:16,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:35:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 142028 states and 236551 transitions. [2019-11-24 03:35:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-24 03:35:16,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:35:16,725 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, 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, 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 03:35:16,725 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:35:16,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:35:16,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1559144942, now seen corresponding path program 1 times [2019-11-24 03:35:16,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:35:16,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477940722] [2019-11-24 03:35:16,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:35:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:35:17,062 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 03:35:17,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477940722] [2019-11-24 03:35:17,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:35:17,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:35:17,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146793903] [2019-11-24 03:35:17,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:35:17,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:35:17,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:35:17,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:35:17,064 INFO L87 Difference]: Start difference. First operand 142028 states and 236551 transitions. Second operand 3 states.