./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea94c2a7f5c98d387db22a0b269794366125ef96ca4390d29fd777c1f058153c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:08:10,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:08:10,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:08:10,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:08:10,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:08:10,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:08:10,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:08:10,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:08:10,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:08:10,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:08:10,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:08:10,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:08:10,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:08:10,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:08:10,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:08:10,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:08:10,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:08:10,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:08:10,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:08:10,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:08:10,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:08:10,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:08:10,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:08:11,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:08:11,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:08:11,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:08:11,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:08:11,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:08:11,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:08:11,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:08:11,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:08:11,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:08:11,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:08:11,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:08:11,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:08:11,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:08:11,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:08:11,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:08:11,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:08:11,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:08:11,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:08:11,036 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 02:08:11,095 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:08:11,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:08:11,098 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:08:11,098 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:08:11,099 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:08:11,099 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:08:11,099 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 02:08:11,100 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:08:11,100 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:08:11,100 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 02:08:11,102 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 02:08:11,102 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:08:11,103 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 02:08:11,103 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 02:08:11,103 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 02:08:11,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:08:11,105 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:08:11,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 02:08:11,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:08:11,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:08:11,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 02:08:11,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:08:11,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 02:08:11,107 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 02:08:11,107 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:08:11,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 02:08:11,108 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:08:11,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 02:08:11,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:08:11,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:08:11,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:08:11,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:08:11,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:08:11,111 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 02:08:11,111 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 02:08:11,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 02:08:11,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 02:08:11,112 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:08:11,112 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:08:11,112 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea94c2a7f5c98d387db22a0b269794366125ef96ca4390d29fd777c1f058153c [2021-11-07 02:08:11,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:08:11,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:08:11,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:08:11,560 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:08:11,561 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:08:11,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2021-11-07 02:08:11,666 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/data/c6b3f7bbb/f09e95ea21a648d3853707572a5b2fa6/FLAG7af0ed4b7 [2021-11-07 02:08:12,452 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:08:12,457 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2021-11-07 02:08:12,487 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/data/c6b3f7bbb/f09e95ea21a648d3853707572a5b2fa6/FLAG7af0ed4b7 [2021-11-07 02:08:12,688 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/data/c6b3f7bbb/f09e95ea21a648d3853707572a5b2fa6 [2021-11-07 02:08:12,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:08:12,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:08:12,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:08:12,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:08:12,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:08:12,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:08:12" (1/1) ... [2021-11-07 02:08:12,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3cca9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:12, skipping insertion in model container [2021-11-07 02:08:12,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:08:12" (1/1) ... [2021-11-07 02:08:12,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:08:12,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:08:13,077 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c[2713,2726] [2021-11-07 02:08:13,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:08:13,245 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:08:13,284 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c[2713,2726] [2021-11-07 02:08:13,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:08:13,409 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:08:13,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:13 WrapperNode [2021-11-07 02:08:13,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:08:13,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:08:13,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:08:13,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:08:13,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:13" (1/1) ... [2021-11-07 02:08:13,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:13" (1/1) ... [2021-11-07 02:08:13,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:08:13,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:08:13,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:08:13,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:08:13,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:13" (1/1) ... [2021-11-07 02:08:13,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:13" (1/1) ... [2021-11-07 02:08:13,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:13" (1/1) ... [2021-11-07 02:08:13,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:13" (1/1) ... [2021-11-07 02:08:13,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:13" (1/1) ... [2021-11-07 02:08:13,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:13" (1/1) ... [2021-11-07 02:08:13,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:13" (1/1) ... [2021-11-07 02:08:13,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:08:13,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:08:13,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:08:13,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:08:13,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:13" (1/1) ... [2021-11-07 02:08:13,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:08:13,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:08:13,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:08:13,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:08:13,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:08:13,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 02:08:13,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:08:13,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:08:14,058 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,066 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,093 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,117 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,120 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,126 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,132 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,154 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,157 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,159 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,196 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,203 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,206 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,221 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,227 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,234 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,259 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,280 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,284 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,287 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,291 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,293 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,294 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:14,305 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:08:15,581 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume !false; [2021-11-07 02:08:15,581 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##415: assume false; [2021-11-07 02:08:15,581 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##445: assume false; [2021-11-07 02:08:15,582 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##290: assume false; [2021-11-07 02:08:15,582 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##291: assume !false; [2021-11-07 02:08:15,582 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##490: assume !false; [2021-11-07 02:08:15,582 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##269: assume false; [2021-11-07 02:08:15,582 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##270: assume !false; [2021-11-07 02:08:15,583 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume !false; [2021-11-07 02:08:15,583 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##209: assume false; [2021-11-07 02:08:15,583 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume !false; [2021-11-07 02:08:15,583 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-11-07 02:08:15,584 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-11-07 02:08:15,584 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##470: assume false; [2021-11-07 02:08:15,584 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##232: assume false; [2021-11-07 02:08:15,584 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##471: assume !false; [2021-11-07 02:08:15,584 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##233: assume !false; [2021-11-07 02:08:15,585 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##242: assume !false; [2021-11-07 02:08:15,585 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##241: assume false; [2021-11-07 02:08:15,586 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume false; [2021-11-07 02:08:15,586 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume !false; [2021-11-07 02:08:15,586 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##245: assume false; [2021-11-07 02:08:15,587 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-11-07 02:08:15,588 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-11-07 02:08:15,588 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2021-11-07 02:08:15,589 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2021-11-07 02:08:15,589 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##175: assume !false; [2021-11-07 02:08:15,590 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume false; [2021-11-07 02:08:15,590 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2021-11-07 02:08:15,591 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2021-11-07 02:08:15,591 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2021-11-07 02:08:15,591 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2021-11-07 02:08:15,591 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2021-11-07 02:08:15,592 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2021-11-07 02:08:15,592 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2021-11-07 02:08:15,592 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2021-11-07 02:08:15,592 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume false; [2021-11-07 02:08:15,592 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-11-07 02:08:15,593 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##394: assume !false; [2021-11-07 02:08:15,594 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-11-07 02:08:15,594 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2021-11-07 02:08:15,595 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2021-11-07 02:08:15,595 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##329: assume false; [2021-11-07 02:08:15,595 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##330: assume !false; [2021-11-07 02:08:15,595 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2021-11-07 02:08:15,596 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2021-11-07 02:08:15,596 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##364: assume !false; [2021-11-07 02:08:15,596 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##363: assume false; [2021-11-07 02:08:16,775 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:08:16,775 INFO L299 CfgBuilder]: Removed 207 assume(true) statements. [2021-11-07 02:08:16,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:08:16 BoogieIcfgContainer [2021-11-07 02:08:16,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:08:16,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:08:16,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:08:16,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:08:16,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:08:12" (1/3) ... [2021-11-07 02:08:16,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e8434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:08:16, skipping insertion in model container [2021-11-07 02:08:16,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:08:13" (2/3) ... [2021-11-07 02:08:16,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e8434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:08:16, skipping insertion in model container [2021-11-07 02:08:16,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:08:16" (3/3) ... [2021-11-07 02:08:16,794 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-1.c [2021-11-07 02:08:16,801 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:08:16,801 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2021-11-07 02:08:16,863 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:08:16,871 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 02:08:16,872 INFO L340 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2021-11-07 02:08:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 258 states, 216 states have (on average 1.7777777777777777) internal successors, (384), 257 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:16,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 02:08:16,926 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:16,927 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:16,928 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:16,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:16,947 INFO L85 PathProgramCache]: Analyzing trace with hash -510467847, now seen corresponding path program 1 times [2021-11-07 02:08:16,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:16,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233088377] [2021-11-07 02:08:16,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:16,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:17,226 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:17,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233088377] [2021-11-07 02:08:17,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233088377] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:17,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:17,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:17,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457700604] [2021-11-07 02:08:17,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:08:17,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:17,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:08:17,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:08:17,257 INFO L87 Difference]: Start difference. First operand has 258 states, 216 states have (on average 1.7777777777777777) internal successors, (384), 257 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:17,607 INFO L93 Difference]: Finished difference Result 486 states and 724 transitions. [2021-11-07 02:08:17,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:08:17,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-07 02:08:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:17,625 INFO L225 Difference]: With dead ends: 486 [2021-11-07 02:08:17,626 INFO L226 Difference]: Without dead ends: 259 [2021-11-07 02:08:17,631 INFO L786 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 [2021-11-07 02:08:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-11-07 02:08:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2021-11-07 02:08:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 230 states have (on average 1.491304347826087) internal successors, (343), 258 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 343 transitions. [2021-11-07 02:08:17,724 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 343 transitions. Word has length 7 [2021-11-07 02:08:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:17,726 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 343 transitions. [2021-11-07 02:08:17,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 343 transitions. [2021-11-07 02:08:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 02:08:17,729 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:17,729 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:17,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 02:08:17,730 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:17,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:17,737 INFO L85 PathProgramCache]: Analyzing trace with hash -873900632, now seen corresponding path program 1 times [2021-11-07 02:08:17,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:17,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137629684] [2021-11-07 02:08:17,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:17,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:17,902 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:17,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137629684] [2021-11-07 02:08:17,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137629684] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:17,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:17,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:17,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832619252] [2021-11-07 02:08:17,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:08:17,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:17,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:08:17,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:08:17,909 INFO L87 Difference]: Start difference. First operand 259 states and 343 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:18,019 INFO L93 Difference]: Finished difference Result 481 states and 629 transitions. [2021-11-07 02:08:18,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:08:18,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-07 02:08:18,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:18,028 INFO L225 Difference]: With dead ends: 481 [2021-11-07 02:08:18,029 INFO L226 Difference]: Without dead ends: 336 [2021-11-07 02:08:18,034 INFO L786 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 [2021-11-07 02:08:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-11-07 02:08:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 247. [2021-11-07 02:08:18,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 226 states have (on average 1.4424778761061947) internal successors, (326), 246 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 326 transitions. [2021-11-07 02:08:18,074 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 326 transitions. Word has length 9 [2021-11-07 02:08:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:18,074 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 326 transitions. [2021-11-07 02:08:18,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:18,075 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 326 transitions. [2021-11-07 02:08:18,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 02:08:18,076 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:18,077 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:18,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 02:08:18,077 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:18,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:18,078 INFO L85 PathProgramCache]: Analyzing trace with hash 765253587, now seen corresponding path program 1 times [2021-11-07 02:08:18,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:18,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006854345] [2021-11-07 02:08:18,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:18,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:18,134 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:18,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006854345] [2021-11-07 02:08:18,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006854345] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:18,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:18,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 02:08:18,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388945555] [2021-11-07 02:08:18,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:08:18,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:18,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:08:18,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:08:18,141 INFO L87 Difference]: Start difference. First operand 247 states and 326 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:18,167 INFO L93 Difference]: Finished difference Result 269 states and 351 transitions. [2021-11-07 02:08:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:08:18,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-07 02:08:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:18,170 INFO L225 Difference]: With dead ends: 269 [2021-11-07 02:08:18,171 INFO L226 Difference]: Without dead ends: 247 [2021-11-07 02:08:18,173 INFO L786 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 [2021-11-07 02:08:18,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-11-07 02:08:18,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2021-11-07 02:08:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 226 states have (on average 1.4380530973451326) internal successors, (325), 246 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 325 transitions. [2021-11-07 02:08:18,203 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 325 transitions. Word has length 10 [2021-11-07 02:08:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:18,203 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 325 transitions. [2021-11-07 02:08:18,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:18,204 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 325 transitions. [2021-11-07 02:08:18,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 02:08:18,206 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:18,206 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:18,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 02:08:18,207 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:18,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:18,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1366602656, now seen corresponding path program 1 times [2021-11-07 02:08:18,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:18,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830652540] [2021-11-07 02:08:18,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:18,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:18,298 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:18,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830652540] [2021-11-07 02:08:18,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830652540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:18,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:18,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:18,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658484040] [2021-11-07 02:08:18,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:08:18,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:18,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:08:18,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:08:18,303 INFO L87 Difference]: Start difference. First operand 247 states and 325 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:18,341 INFO L93 Difference]: Finished difference Result 307 states and 397 transitions. [2021-11-07 02:08:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:08:18,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 02:08:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:18,345 INFO L225 Difference]: With dead ends: 307 [2021-11-07 02:08:18,345 INFO L226 Difference]: Without dead ends: 284 [2021-11-07 02:08:18,346 INFO L786 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 [2021-11-07 02:08:18,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-07 02:08:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 271. [2021-11-07 02:08:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 251 states have (on average 1.4342629482071714) internal successors, (360), 270 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 360 transitions. [2021-11-07 02:08:18,367 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 360 transitions. Word has length 13 [2021-11-07 02:08:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:18,367 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 360 transitions. [2021-11-07 02:08:18,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 360 transitions. [2021-11-07 02:08:18,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 02:08:18,371 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:18,371 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:18,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 02:08:18,372 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:18,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:18,373 INFO L85 PathProgramCache]: Analyzing trace with hash -897998562, now seen corresponding path program 1 times [2021-11-07 02:08:18,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:18,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582198843] [2021-11-07 02:08:18,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:18,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:18,452 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:18,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582198843] [2021-11-07 02:08:18,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582198843] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:18,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:18,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:08:18,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921242102] [2021-11-07 02:08:18,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:08:18,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:18,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:08:18,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:08:18,456 INFO L87 Difference]: Start difference. First operand 271 states and 360 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:18,506 INFO L93 Difference]: Finished difference Result 337 states and 429 transitions. [2021-11-07 02:08:18,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:08:18,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-07 02:08:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:18,510 INFO L225 Difference]: With dead ends: 337 [2021-11-07 02:08:18,510 INFO L226 Difference]: Without dead ends: 301 [2021-11-07 02:08:18,511 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:08:18,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-07 02:08:18,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 258. [2021-11-07 02:08:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 238 states have (on average 1.4243697478991597) internal successors, (339), 257 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 339 transitions. [2021-11-07 02:08:18,532 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 339 transitions. Word has length 16 [2021-11-07 02:08:18,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:18,533 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 339 transitions. [2021-11-07 02:08:18,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 339 transitions. [2021-11-07 02:08:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 02:08:18,535 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:18,536 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:18,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 02:08:18,537 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:18,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:18,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1711216500, now seen corresponding path program 1 times [2021-11-07 02:08:18,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:18,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414491846] [2021-11-07 02:08:18,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:18,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:18,586 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:18,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414491846] [2021-11-07 02:08:18,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414491846] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:18,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:18,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:18,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646583257] [2021-11-07 02:08:18,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:08:18,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:18,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:08:18,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:08:18,590 INFO L87 Difference]: Start difference. First operand 258 states and 339 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:18,749 INFO L93 Difference]: Finished difference Result 289 states and 377 transitions. [2021-11-07 02:08:18,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:08:18,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-07 02:08:18,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:18,753 INFO L225 Difference]: With dead ends: 289 [2021-11-07 02:08:18,753 INFO L226 Difference]: Without dead ends: 284 [2021-11-07 02:08:18,754 INFO L786 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 [2021-11-07 02:08:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-07 02:08:18,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2021-11-07 02:08:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 261 states have (on average 1.4137931034482758) internal successors, (369), 280 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 369 transitions. [2021-11-07 02:08:18,773 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 369 transitions. Word has length 16 [2021-11-07 02:08:18,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:18,773 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 369 transitions. [2021-11-07 02:08:18,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 369 transitions. [2021-11-07 02:08:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:08:18,775 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:18,776 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:18,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 02:08:18,776 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:18,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash 274723131, now seen corresponding path program 1 times [2021-11-07 02:08:18,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:18,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286420297] [2021-11-07 02:08:18,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:18,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:18,901 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:18,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286420297] [2021-11-07 02:08:18,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286420297] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:18,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:18,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:18,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368848460] [2021-11-07 02:08:18,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:08:18,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:18,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:08:18,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:08:18,905 INFO L87 Difference]: Start difference. First operand 281 states and 369 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:19,080 INFO L93 Difference]: Finished difference Result 381 states and 502 transitions. [2021-11-07 02:08:19,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:08:19,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 02:08:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:19,091 INFO L225 Difference]: With dead ends: 381 [2021-11-07 02:08:19,091 INFO L226 Difference]: Without dead ends: 278 [2021-11-07 02:08:19,092 INFO L786 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 [2021-11-07 02:08:19,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-07 02:08:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2021-11-07 02:08:19,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 260 states have (on average 1.4038461538461537) internal successors, (365), 277 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 365 transitions. [2021-11-07 02:08:19,113 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 365 transitions. Word has length 17 [2021-11-07 02:08:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:19,117 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 365 transitions. [2021-11-07 02:08:19,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 365 transitions. [2021-11-07 02:08:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:08:19,119 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:19,119 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:19,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 02:08:19,120 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:19,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash 846281230, now seen corresponding path program 1 times [2021-11-07 02:08:19,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:19,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670435735] [2021-11-07 02:08:19,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:19,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:19,205 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:19,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670435735] [2021-11-07 02:08:19,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670435735] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:19,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:19,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:19,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984852885] [2021-11-07 02:08:19,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:08:19,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:19,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:08:19,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:08:19,209 INFO L87 Difference]: Start difference. First operand 278 states and 365 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:19,367 INFO L93 Difference]: Finished difference Result 278 states and 365 transitions. [2021-11-07 02:08:19,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:08:19,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 02:08:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:19,371 INFO L225 Difference]: With dead ends: 278 [2021-11-07 02:08:19,371 INFO L226 Difference]: Without dead ends: 266 [2021-11-07 02:08:19,372 INFO L786 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 [2021-11-07 02:08:19,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-11-07 02:08:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-11-07 02:08:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 254 states have (on average 1.389763779527559) internal successors, (353), 265 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:19,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 353 transitions. [2021-11-07 02:08:19,391 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 353 transitions. Word has length 17 [2021-11-07 02:08:19,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:19,391 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 353 transitions. [2021-11-07 02:08:19,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 353 transitions. [2021-11-07 02:08:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:08:19,393 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:19,393 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:19,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 02:08:19,394 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:19,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:19,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1525683153, now seen corresponding path program 1 times [2021-11-07 02:08:19,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:19,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121942369] [2021-11-07 02:08:19,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:19,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:19,505 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:19,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121942369] [2021-11-07 02:08:19,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121942369] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:19,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:19,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:19,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333025506] [2021-11-07 02:08:19,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:08:19,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:19,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:08:19,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:08:19,509 INFO L87 Difference]: Start difference. First operand 266 states and 353 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:19,696 INFO L93 Difference]: Finished difference Result 278 states and 363 transitions. [2021-11-07 02:08:19,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:08:19,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 02:08:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:19,700 INFO L225 Difference]: With dead ends: 278 [2021-11-07 02:08:19,700 INFO L226 Difference]: Without dead ends: 269 [2021-11-07 02:08:19,705 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:08:19,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-11-07 02:08:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2021-11-07 02:08:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 254 states have (on average 1.3818897637795275) internal successors, (351), 265 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 351 transitions. [2021-11-07 02:08:19,730 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 351 transitions. Word has length 17 [2021-11-07 02:08:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:19,731 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 351 transitions. [2021-11-07 02:08:19,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:19,732 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 351 transitions. [2021-11-07 02:08:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 02:08:19,733 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:19,733 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:19,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 02:08:19,734 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:19,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:19,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1981549689, now seen corresponding path program 1 times [2021-11-07 02:08:19,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:19,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034953460] [2021-11-07 02:08:19,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:19,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:19,807 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:19,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034953460] [2021-11-07 02:08:19,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034953460] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:19,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:19,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:19,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532681107] [2021-11-07 02:08:19,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:08:19,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:19,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:08:19,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:08:19,811 INFO L87 Difference]: Start difference. First operand 266 states and 351 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:19,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:19,893 INFO L93 Difference]: Finished difference Result 359 states and 463 transitions. [2021-11-07 02:08:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:08:19,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 02:08:19,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:19,896 INFO L225 Difference]: With dead ends: 359 [2021-11-07 02:08:19,897 INFO L226 Difference]: Without dead ends: 264 [2021-11-07 02:08:19,898 INFO L786 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 [2021-11-07 02:08:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-11-07 02:08:19,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2021-11-07 02:08:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 238 states have (on average 1.361344537815126) internal successors, (324), 249 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 324 transitions. [2021-11-07 02:08:19,924 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 324 transitions. Word has length 18 [2021-11-07 02:08:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:19,924 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 324 transitions. [2021-11-07 02:08:19,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 324 transitions. [2021-11-07 02:08:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 02:08:19,927 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:19,927 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:19,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 02:08:19,928 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:19,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash -481424925, now seen corresponding path program 1 times [2021-11-07 02:08:19,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:19,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592928154] [2021-11-07 02:08:19,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:19,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:19,992 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:19,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592928154] [2021-11-07 02:08:19,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592928154] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:19,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:19,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:19,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928153847] [2021-11-07 02:08:19,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:08:19,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:19,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:08:19,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:08:19,996 INFO L87 Difference]: Start difference. First operand 250 states and 324 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:20,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:20,175 INFO L93 Difference]: Finished difference Result 262 states and 334 transitions. [2021-11-07 02:08:20,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:08:20,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 02:08:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:20,178 INFO L225 Difference]: With dead ends: 262 [2021-11-07 02:08:20,178 INFO L226 Difference]: Without dead ends: 253 [2021-11-07 02:08:20,179 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:08:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-11-07 02:08:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2021-11-07 02:08:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 238 states have (on average 1.3529411764705883) internal successors, (322), 249 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 322 transitions. [2021-11-07 02:08:20,201 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 322 transitions. Word has length 18 [2021-11-07 02:08:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:20,202 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 322 transitions. [2021-11-07 02:08:20,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 322 transitions. [2021-11-07 02:08:20,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 02:08:20,203 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:20,203 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:20,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 02:08:20,204 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:20,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1492059418, now seen corresponding path program 1 times [2021-11-07 02:08:20,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:20,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325162872] [2021-11-07 02:08:20,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:20,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:20,250 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:20,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325162872] [2021-11-07 02:08:20,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325162872] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:20,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:20,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:20,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176083794] [2021-11-07 02:08:20,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:08:20,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:20,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:08:20,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:08:20,253 INFO L87 Difference]: Start difference. First operand 250 states and 322 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:20,446 INFO L93 Difference]: Finished difference Result 324 states and 411 transitions. [2021-11-07 02:08:20,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:08:20,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-07 02:08:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:20,450 INFO L225 Difference]: With dead ends: 324 [2021-11-07 02:08:20,450 INFO L226 Difference]: Without dead ends: 316 [2021-11-07 02:08:20,451 INFO L786 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 [2021-11-07 02:08:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-11-07 02:08:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 258. [2021-11-07 02:08:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 246 states have (on average 1.3577235772357723) internal successors, (334), 257 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 334 transitions. [2021-11-07 02:08:20,476 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 334 transitions. Word has length 19 [2021-11-07 02:08:20,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:20,477 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 334 transitions. [2021-11-07 02:08:20,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 334 transitions. [2021-11-07 02:08:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 02:08:20,479 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:20,479 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:20,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 02:08:20,480 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:20,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1891738440, now seen corresponding path program 1 times [2021-11-07 02:08:20,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:20,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551576633] [2021-11-07 02:08:20,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:20,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:20,525 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:20,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551576633] [2021-11-07 02:08:20,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551576633] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:20,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:20,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:08:20,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909345238] [2021-11-07 02:08:20,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:08:20,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:20,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:08:20,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:08:20,528 INFO L87 Difference]: Start difference. First operand 258 states and 334 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:20,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:20,581 INFO L93 Difference]: Finished difference Result 271 states and 346 transitions. [2021-11-07 02:08:20,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:08:20,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-07 02:08:20,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:20,585 INFO L225 Difference]: With dead ends: 271 [2021-11-07 02:08:20,585 INFO L226 Difference]: Without dead ends: 256 [2021-11-07 02:08:20,586 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:08:20,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-07 02:08:20,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-11-07 02:08:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 244 states have (on average 1.3565573770491803) internal successors, (331), 255 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 331 transitions. [2021-11-07 02:08:20,610 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 331 transitions. Word has length 19 [2021-11-07 02:08:20,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:20,610 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 331 transitions. [2021-11-07 02:08:20,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 331 transitions. [2021-11-07 02:08:20,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 02:08:20,612 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:20,612 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:20,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 02:08:20,613 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:20,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:20,614 INFO L85 PathProgramCache]: Analyzing trace with hash 983139277, now seen corresponding path program 1 times [2021-11-07 02:08:20,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:20,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662516765] [2021-11-07 02:08:20,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:20,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:20,668 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:20,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662516765] [2021-11-07 02:08:20,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662516765] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:20,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:20,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:20,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207850787] [2021-11-07 02:08:20,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:08:20,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:20,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:08:20,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:08:20,671 INFO L87 Difference]: Start difference. First operand 256 states and 331 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:20,717 INFO L93 Difference]: Finished difference Result 373 states and 473 transitions. [2021-11-07 02:08:20,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:08:20,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 02:08:20,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:20,720 INFO L225 Difference]: With dead ends: 373 [2021-11-07 02:08:20,721 INFO L226 Difference]: Without dead ends: 279 [2021-11-07 02:08:20,721 INFO L786 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 [2021-11-07 02:08:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-11-07 02:08:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 244. [2021-11-07 02:08:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 235 states have (on average 1.3319148936170213) internal successors, (313), 243 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 313 transitions. [2021-11-07 02:08:20,746 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 313 transitions. Word has length 20 [2021-11-07 02:08:20,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:20,746 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 313 transitions. [2021-11-07 02:08:20,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 313 transitions. [2021-11-07 02:08:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 02:08:20,748 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:20,748 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:20,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 02:08:20,749 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:20,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:20,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1221054761, now seen corresponding path program 1 times [2021-11-07 02:08:20,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:20,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207300601] [2021-11-07 02:08:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:20,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:20,827 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:20,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207300601] [2021-11-07 02:08:20,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207300601] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:20,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:20,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:20,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122810389] [2021-11-07 02:08:20,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:08:20,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:20,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:08:20,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:08:20,830 INFO L87 Difference]: Start difference. First operand 244 states and 313 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:21,048 INFO L93 Difference]: Finished difference Result 279 states and 354 transitions. [2021-11-07 02:08:21,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:08:21,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 02:08:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:21,051 INFO L225 Difference]: With dead ends: 279 [2021-11-07 02:08:21,052 INFO L226 Difference]: Without dead ends: 239 [2021-11-07 02:08:21,052 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:08:21,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-07 02:08:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-11-07 02:08:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 231 states have (on average 1.3203463203463204) internal successors, (305), 238 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 305 transitions. [2021-11-07 02:08:21,079 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 305 transitions. Word has length 20 [2021-11-07 02:08:21,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:21,079 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 305 transitions. [2021-11-07 02:08:21,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 305 transitions. [2021-11-07 02:08:21,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 02:08:21,081 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:21,081 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:21,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 02:08:21,081 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:21,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2081358437, now seen corresponding path program 1 times [2021-11-07 02:08:21,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:21,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469435272] [2021-11-07 02:08:21,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:21,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:21,224 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:21,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469435272] [2021-11-07 02:08:21,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469435272] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:21,228 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:21,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:21,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484763105] [2021-11-07 02:08:21,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:08:21,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:21,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:08:21,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:08:21,231 INFO L87 Difference]: Start difference. First operand 239 states and 305 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:21,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:21,309 INFO L93 Difference]: Finished difference Result 339 states and 427 transitions. [2021-11-07 02:08:21,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:08:21,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 02:08:21,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:21,312 INFO L225 Difference]: With dead ends: 339 [2021-11-07 02:08:21,312 INFO L226 Difference]: Without dead ends: 241 [2021-11-07 02:08:21,313 INFO L786 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 [2021-11-07 02:08:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-11-07 02:08:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 227. [2021-11-07 02:08:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 220 states have (on average 1.3045454545454545) internal successors, (287), 226 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 287 transitions. [2021-11-07 02:08:21,345 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 287 transitions. Word has length 21 [2021-11-07 02:08:21,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:21,346 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 287 transitions. [2021-11-07 02:08:21,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 287 transitions. [2021-11-07 02:08:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 02:08:21,348 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:21,348 INFO L513 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] [2021-11-07 02:08:21,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 02:08:21,349 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:21,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:21,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2014999082, now seen corresponding path program 1 times [2021-11-07 02:08:21,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:21,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348890665] [2021-11-07 02:08:21,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:21,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:21,420 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:21,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348890665] [2021-11-07 02:08:21,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348890665] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:21,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:21,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:21,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496039982] [2021-11-07 02:08:21,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:08:21,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:21,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:08:21,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:08:21,424 INFO L87 Difference]: Start difference. First operand 227 states and 287 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:21,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:21,658 INFO L93 Difference]: Finished difference Result 342 states and 427 transitions. [2021-11-07 02:08:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:08:21,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 02:08:21,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:21,662 INFO L225 Difference]: With dead ends: 342 [2021-11-07 02:08:21,662 INFO L226 Difference]: Without dead ends: 256 [2021-11-07 02:08:21,663 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:08:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-07 02:08:21,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 227. [2021-11-07 02:08:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 220 states have (on average 1.290909090909091) internal successors, (284), 226 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 284 transitions. [2021-11-07 02:08:21,701 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 284 transitions. Word has length 22 [2021-11-07 02:08:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:21,702 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 284 transitions. [2021-11-07 02:08:21,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 284 transitions. [2021-11-07 02:08:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 02:08:21,704 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:21,704 INFO L513 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] [2021-11-07 02:08:21,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 02:08:21,704 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:21,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:21,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1370270137, now seen corresponding path program 1 times [2021-11-07 02:08:21,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:21,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144441549] [2021-11-07 02:08:21,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:21,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:21,840 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:21,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144441549] [2021-11-07 02:08:21,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144441549] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:21,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:21,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:08:21,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851819330] [2021-11-07 02:08:21,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:08:21,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:21,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:08:21,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:08:21,846 INFO L87 Difference]: Start difference. First operand 227 states and 284 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:22,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:22,200 INFO L93 Difference]: Finished difference Result 303 states and 378 transitions. [2021-11-07 02:08:22,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:08:22,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 02:08:22,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:22,205 INFO L225 Difference]: With dead ends: 303 [2021-11-07 02:08:22,205 INFO L226 Difference]: Without dead ends: 299 [2021-11-07 02:08:22,207 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:08:22,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-11-07 02:08:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 227. [2021-11-07 02:08:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 220 states have (on average 1.290909090909091) internal successors, (284), 226 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 284 transitions. [2021-11-07 02:08:22,241 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 284 transitions. Word has length 23 [2021-11-07 02:08:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:22,241 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 284 transitions. [2021-11-07 02:08:22,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:22,242 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 284 transitions. [2021-11-07 02:08:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:08:22,243 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:22,243 INFO L513 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] [2021-11-07 02:08:22,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 02:08:22,244 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:22,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:22,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1831218950, now seen corresponding path program 1 times [2021-11-07 02:08:22,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:22,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002624450] [2021-11-07 02:08:22,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:22,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:22,310 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:22,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002624450] [2021-11-07 02:08:22,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002624450] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:22,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:22,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:22,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025458853] [2021-11-07 02:08:22,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:08:22,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:22,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:08:22,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:08:22,316 INFO L87 Difference]: Start difference. First operand 227 states and 284 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:22,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:22,497 INFO L93 Difference]: Finished difference Result 299 states and 367 transitions. [2021-11-07 02:08:22,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:08:22,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-07 02:08:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:22,500 INFO L225 Difference]: With dead ends: 299 [2021-11-07 02:08:22,501 INFO L226 Difference]: Without dead ends: 256 [2021-11-07 02:08:22,501 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:08:22,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-07 02:08:22,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 227. [2021-11-07 02:08:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 220 states have (on average 1.2636363636363637) internal successors, (278), 226 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 278 transitions. [2021-11-07 02:08:22,534 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 278 transitions. Word has length 24 [2021-11-07 02:08:22,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:22,534 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 278 transitions. [2021-11-07 02:08:22,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 278 transitions. [2021-11-07 02:08:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 02:08:22,536 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:22,536 INFO L513 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] [2021-11-07 02:08:22,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 02:08:22,536 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:22,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash -867731228, now seen corresponding path program 1 times [2021-11-07 02:08:22,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:22,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63891247] [2021-11-07 02:08:22,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:22,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:22,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:22,595 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:22,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63891247] [2021-11-07 02:08:22,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63891247] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:22,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:22,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:22,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267484675] [2021-11-07 02:08:22,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:08:22,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:22,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:08:22,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:08:22,598 INFO L87 Difference]: Start difference. First operand 227 states and 278 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:22,777 INFO L93 Difference]: Finished difference Result 270 states and 328 transitions. [2021-11-07 02:08:22,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:08:22,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 02:08:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:22,780 INFO L225 Difference]: With dead ends: 270 [2021-11-07 02:08:22,780 INFO L226 Difference]: Without dead ends: 227 [2021-11-07 02:08:22,781 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:08:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-11-07 02:08:22,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-11-07 02:08:22,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 220 states have (on average 1.2363636363636363) internal successors, (272), 226 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2021-11-07 02:08:22,813 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 25 [2021-11-07 02:08:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:22,814 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2021-11-07 02:08:22,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2021-11-07 02:08:22,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 02:08:22,815 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:22,816 INFO L513 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] [2021-11-07 02:08:22,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 02:08:22,816 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:22,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:22,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1729621359, now seen corresponding path program 1 times [2021-11-07 02:08:22,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:22,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199403445] [2021-11-07 02:08:22,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:22,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:22,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:22,927 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:22,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199403445] [2021-11-07 02:08:22,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199403445] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:22,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:22,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:08:22,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040905814] [2021-11-07 02:08:22,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:08:22,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:22,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:08:22,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:08:22,934 INFO L87 Difference]: Start difference. First operand 227 states and 272 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:23,182 INFO L93 Difference]: Finished difference Result 247 states and 298 transitions. [2021-11-07 02:08:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:08:23,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 02:08:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:23,185 INFO L225 Difference]: With dead ends: 247 [2021-11-07 02:08:23,185 INFO L226 Difference]: Without dead ends: 245 [2021-11-07 02:08:23,185 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:08:23,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-11-07 02:08:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2021-11-07 02:08:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 220 states have (on average 1.2363636363636363) internal successors, (272), 226 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2021-11-07 02:08:23,217 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 25 [2021-11-07 02:08:23,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:23,219 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2021-11-07 02:08:23,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:23,219 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2021-11-07 02:08:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 02:08:23,221 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:23,222 INFO L513 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] [2021-11-07 02:08:23,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 02:08:23,222 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:23,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:23,223 INFO L85 PathProgramCache]: Analyzing trace with hash -890782658, now seen corresponding path program 1 times [2021-11-07 02:08:23,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:23,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618302309] [2021-11-07 02:08:23,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:23,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:23,309 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:23,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618302309] [2021-11-07 02:08:23,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618302309] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:23,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:23,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:08:23,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631167786] [2021-11-07 02:08:23,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:08:23,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:23,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:08:23,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:08:23,313 INFO L87 Difference]: Start difference. First operand 227 states and 272 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:23,408 INFO L93 Difference]: Finished difference Result 245 states and 289 transitions. [2021-11-07 02:08:23,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:08:23,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-07 02:08:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:23,411 INFO L225 Difference]: With dead ends: 245 [2021-11-07 02:08:23,411 INFO L226 Difference]: Without dead ends: 228 [2021-11-07 02:08:23,411 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:08:23,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-11-07 02:08:23,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2021-11-07 02:08:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 218 states have (on average 1.224770642201835) internal successors, (267), 224 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 267 transitions. [2021-11-07 02:08:23,442 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 267 transitions. Word has length 26 [2021-11-07 02:08:23,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:23,443 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 267 transitions. [2021-11-07 02:08:23,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 267 transitions. [2021-11-07 02:08:23,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 02:08:23,444 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:23,444 INFO L513 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] [2021-11-07 02:08:23,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 02:08:23,445 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:23,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:23,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1630670027, now seen corresponding path program 1 times [2021-11-07 02:08:23,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:23,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083806565] [2021-11-07 02:08:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:23,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:23,479 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:23,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083806565] [2021-11-07 02:08:23,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083806565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:23,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:23,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:23,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603499634] [2021-11-07 02:08:23,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:08:23,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:23,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:08:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:08:23,485 INFO L87 Difference]: Start difference. First operand 225 states and 267 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:23,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:23,598 INFO L93 Difference]: Finished difference Result 245 states and 284 transitions. [2021-11-07 02:08:23,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:08:23,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-07 02:08:23,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:23,601 INFO L225 Difference]: With dead ends: 245 [2021-11-07 02:08:23,601 INFO L226 Difference]: Without dead ends: 224 [2021-11-07 02:08:23,601 INFO L786 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 [2021-11-07 02:08:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-11-07 02:08:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2021-11-07 02:08:23,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 212 states have (on average 1.1981132075471699) internal successors, (254), 217 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 254 transitions. [2021-11-07 02:08:23,636 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 254 transitions. Word has length 26 [2021-11-07 02:08:23,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:23,637 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 254 transitions. [2021-11-07 02:08:23,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:23,637 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 254 transitions. [2021-11-07 02:08:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 02:08:23,638 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:23,638 INFO L513 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] [2021-11-07 02:08:23,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 02:08:23,641 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:23,642 INFO L85 PathProgramCache]: Analyzing trace with hash -778334719, now seen corresponding path program 1 times [2021-11-07 02:08:23,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:23,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91479508] [2021-11-07 02:08:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:23,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:23,754 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:23,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91479508] [2021-11-07 02:08:23,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91479508] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:23,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:23,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:08:23,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153599714] [2021-11-07 02:08:23,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:08:23,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:23,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:08:23,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:08:23,757 INFO L87 Difference]: Start difference. First operand 218 states and 254 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:23,892 INFO L93 Difference]: Finished difference Result 250 states and 297 transitions. [2021-11-07 02:08:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:08:23,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-07 02:08:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:23,895 INFO L225 Difference]: With dead ends: 250 [2021-11-07 02:08:23,896 INFO L226 Difference]: Without dead ends: 244 [2021-11-07 02:08:23,896 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:08:23,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-11-07 02:08:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 204. [2021-11-07 02:08:23,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 200 states have (on average 1.195) internal successors, (239), 203 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 239 transitions. [2021-11-07 02:08:23,925 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 239 transitions. Word has length 27 [2021-11-07 02:08:23,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:23,926 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 239 transitions. [2021-11-07 02:08:23,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 239 transitions. [2021-11-07 02:08:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 02:08:23,927 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:23,927 INFO L513 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] [2021-11-07 02:08:23,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 02:08:23,928 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:23,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash -971245594, now seen corresponding path program 1 times [2021-11-07 02:08:23,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:23,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318879885] [2021-11-07 02:08:23,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:23,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:24,028 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:24,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318879885] [2021-11-07 02:08:24,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318879885] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:24,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:24,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:08:24,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773087006] [2021-11-07 02:08:24,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:08:24,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:24,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:08:24,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:08:24,031 INFO L87 Difference]: Start difference. First operand 204 states and 239 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:24,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:24,219 INFO L93 Difference]: Finished difference Result 221 states and 254 transitions. [2021-11-07 02:08:24,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:08:24,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-07 02:08:24,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:24,222 INFO L225 Difference]: With dead ends: 221 [2021-11-07 02:08:24,222 INFO L226 Difference]: Without dead ends: 218 [2021-11-07 02:08:24,222 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:08:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-07 02:08:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2021-11-07 02:08:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 206 states have (on average 1.1893203883495145) internal successors, (245), 209 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 245 transitions. [2021-11-07 02:08:24,255 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 245 transitions. Word has length 27 [2021-11-07 02:08:24,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:24,255 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 245 transitions. [2021-11-07 02:08:24,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 245 transitions. [2021-11-07 02:08:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 02:08:24,257 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:24,257 INFO L513 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] [2021-11-07 02:08:24,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 02:08:24,258 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:24,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:24,258 INFO L85 PathProgramCache]: Analyzing trace with hash -971257510, now seen corresponding path program 1 times [2021-11-07 02:08:24,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:24,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034702188] [2021-11-07 02:08:24,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:24,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:24,310 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:24,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034702188] [2021-11-07 02:08:24,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034702188] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:24,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:24,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:24,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819132478] [2021-11-07 02:08:24,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:08:24,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:24,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:08:24,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:08:24,314 INFO L87 Difference]: Start difference. First operand 210 states and 245 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:24,459 INFO L93 Difference]: Finished difference Result 218 states and 251 transitions. [2021-11-07 02:08:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:08:24,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-07 02:08:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:24,461 INFO L225 Difference]: With dead ends: 218 [2021-11-07 02:08:24,462 INFO L226 Difference]: Without dead ends: 199 [2021-11-07 02:08:24,462 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:08:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-07 02:08:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2021-11-07 02:08:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 192 states have (on average 1.1927083333333333) internal successors, (229), 195 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2021-11-07 02:08:24,493 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 27 [2021-11-07 02:08:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:24,494 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2021-11-07 02:08:24,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:24,494 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2021-11-07 02:08:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 02:08:24,495 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:24,495 INFO L513 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] [2021-11-07 02:08:24,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-07 02:08:24,496 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:24,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1445203115, now seen corresponding path program 1 times [2021-11-07 02:08:24,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:24,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716223410] [2021-11-07 02:08:24,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:24,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:24,526 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:24,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716223410] [2021-11-07 02:08:24,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716223410] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:24,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:24,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:24,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636232969] [2021-11-07 02:08:24,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:08:24,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:24,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:08:24,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:08:24,529 INFO L87 Difference]: Start difference. First operand 196 states and 229 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:24,572 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2021-11-07 02:08:24,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:08:24,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-07 02:08:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:24,575 INFO L225 Difference]: With dead ends: 217 [2021-11-07 02:08:24,575 INFO L226 Difference]: Without dead ends: 196 [2021-11-07 02:08:24,576 INFO L786 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 [2021-11-07 02:08:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-11-07 02:08:24,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2021-11-07 02:08:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.1675392670157068) internal successors, (223), 194 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 223 transitions. [2021-11-07 02:08:24,605 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 223 transitions. Word has length 28 [2021-11-07 02:08:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:24,606 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 223 transitions. [2021-11-07 02:08:24,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:24,606 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 223 transitions. [2021-11-07 02:08:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:08:24,607 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:24,608 INFO L513 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] [2021-11-07 02:08:24,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-07 02:08:24,608 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:24,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:24,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1419537357, now seen corresponding path program 1 times [2021-11-07 02:08:24,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:24,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647677033] [2021-11-07 02:08:24,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:24,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:24,661 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:24,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647677033] [2021-11-07 02:08:24,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647677033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:24,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:24,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:08:24,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74303008] [2021-11-07 02:08:24,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:08:24,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:24,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:08:24,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:08:24,664 INFO L87 Difference]: Start difference. First operand 195 states and 223 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:24,706 INFO L93 Difference]: Finished difference Result 199 states and 226 transitions. [2021-11-07 02:08:24,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:08:24,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:08:24,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:24,709 INFO L225 Difference]: With dead ends: 199 [2021-11-07 02:08:24,709 INFO L226 Difference]: Without dead ends: 183 [2021-11-07 02:08:24,709 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:08:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-11-07 02:08:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-11-07 02:08:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.1731843575418994) internal successors, (210), 182 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 210 transitions. [2021-11-07 02:08:24,738 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 210 transitions. Word has length 30 [2021-11-07 02:08:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:24,739 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 210 transitions. [2021-11-07 02:08:24,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2021-11-07 02:08:24,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:08:24,740 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:24,740 INFO L513 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] [2021-11-07 02:08:24,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-07 02:08:24,741 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:24,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:24,742 INFO L85 PathProgramCache]: Analyzing trace with hash 826829468, now seen corresponding path program 1 times [2021-11-07 02:08:24,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:24,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589610370] [2021-11-07 02:08:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:24,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:24,793 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:24,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589610370] [2021-11-07 02:08:24,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589610370] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:24,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:24,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:08:24,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907607413] [2021-11-07 02:08:24,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:08:24,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:24,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:08:24,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:08:24,795 INFO L87 Difference]: Start difference. First operand 183 states and 210 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:24,974 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2021-11-07 02:08:24,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 02:08:24,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-07 02:08:24,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:24,976 INFO L225 Difference]: With dead ends: 199 [2021-11-07 02:08:24,977 INFO L226 Difference]: Without dead ends: 153 [2021-11-07 02:08:24,977 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 02:08:24,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-11-07 02:08:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2021-11-07 02:08:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 134 states have (on average 1.2014925373134329) internal successors, (161), 136 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2021-11-07 02:08:25,000 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 30 [2021-11-07 02:08:25,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:25,000 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2021-11-07 02:08:25,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:25,001 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2021-11-07 02:08:25,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-07 02:08:25,002 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:25,002 INFO L513 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] [2021-11-07 02:08:25,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 02:08:25,003 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:25,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:25,003 INFO L85 PathProgramCache]: Analyzing trace with hash 59605634, now seen corresponding path program 1 times [2021-11-07 02:08:25,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:25,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380422662] [2021-11-07 02:08:25,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:25,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:25,116 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:25,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380422662] [2021-11-07 02:08:25,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380422662] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:25,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:25,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 02:08:25,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083625341] [2021-11-07 02:08:25,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 02:08:25,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:25,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 02:08:25,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:08:25,118 INFO L87 Difference]: Start difference. First operand 137 states and 161 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:25,493 INFO L93 Difference]: Finished difference Result 176 states and 208 transitions. [2021-11-07 02:08:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 02:08:25,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-07 02:08:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:25,496 INFO L225 Difference]: With dead ends: 176 [2021-11-07 02:08:25,496 INFO L226 Difference]: Without dead ends: 174 [2021-11-07 02:08:25,496 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-11-07 02:08:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-11-07 02:08:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 137. [2021-11-07 02:08:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 134 states have (on average 1.2014925373134329) internal successors, (161), 136 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2021-11-07 02:08:25,523 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 33 [2021-11-07 02:08:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:25,523 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2021-11-07 02:08:25,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2021-11-07 02:08:25,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 02:08:25,525 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:25,525 INFO L513 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] [2021-11-07 02:08:25,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 02:08:25,526 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:25,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1674195647, now seen corresponding path program 1 times [2021-11-07 02:08:25,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:25,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710942524] [2021-11-07 02:08:25,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:25,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:25,620 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:25,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710942524] [2021-11-07 02:08:25,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710942524] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:25,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:25,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:08:25,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788170187] [2021-11-07 02:08:25,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:08:25,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:25,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:08:25,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:08:25,623 INFO L87 Difference]: Start difference. First operand 137 states and 161 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:25,824 INFO L93 Difference]: Finished difference Result 170 states and 205 transitions. [2021-11-07 02:08:25,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:08:25,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-07 02:08:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:25,827 INFO L225 Difference]: With dead ends: 170 [2021-11-07 02:08:25,827 INFO L226 Difference]: Without dead ends: 168 [2021-11-07 02:08:25,828 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:08:25,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-11-07 02:08:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 123. [2021-11-07 02:08:25,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 121 states have (on average 1.1735537190082646) internal successors, (142), 122 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2021-11-07 02:08:25,856 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 36 [2021-11-07 02:08:25,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:25,857 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2021-11-07 02:08:25,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2021-11-07 02:08:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 02:08:25,858 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:25,859 INFO L513 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] [2021-11-07 02:08:25,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 02:08:25,859 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:25,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:25,860 INFO L85 PathProgramCache]: Analyzing trace with hash 755581325, now seen corresponding path program 1 times [2021-11-07 02:08:25,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:25,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987794378] [2021-11-07 02:08:25,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:25,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:25,935 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:25,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987794378] [2021-11-07 02:08:25,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987794378] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:25,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:25,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:08:25,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611022809] [2021-11-07 02:08:25,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:08:25,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:25,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:08:25,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:08:25,939 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:26,075 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2021-11-07 02:08:26,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:08:26,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-07 02:08:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:26,077 INFO L225 Difference]: With dead ends: 143 [2021-11-07 02:08:26,077 INFO L226 Difference]: Without dead ends: 125 [2021-11-07 02:08:26,079 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 02:08:26,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-07 02:08:26,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-11-07 02:08:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 123 states have (on average 1.1626016260162602) internal successors, (143), 124 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2021-11-07 02:08:26,108 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 37 [2021-11-07 02:08:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:26,109 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2021-11-07 02:08:26,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2021-11-07 02:08:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 02:08:26,111 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:26,111 INFO L513 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] [2021-11-07 02:08:26,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 02:08:26,112 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:26,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:26,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1257169994, now seen corresponding path program 1 times [2021-11-07 02:08:26,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:26,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55943688] [2021-11-07 02:08:26,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:26,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:26,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:26,234 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:26,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55943688] [2021-11-07 02:08:26,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55943688] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:26,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:26,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:08:26,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701785013] [2021-11-07 02:08:26,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:08:26,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:26,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:08:26,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:08:26,237 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:26,410 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2021-11-07 02:08:26,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 02:08:26,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-07 02:08:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:26,412 INFO L225 Difference]: With dead ends: 141 [2021-11-07 02:08:26,412 INFO L226 Difference]: Without dead ends: 125 [2021-11-07 02:08:26,415 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:08:26,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-07 02:08:26,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-11-07 02:08:26,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 123 states have (on average 1.1544715447154472) internal successors, (142), 124 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2021-11-07 02:08:26,442 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 37 [2021-11-07 02:08:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:26,442 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2021-11-07 02:08:26,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:26,443 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2021-11-07 02:08:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-07 02:08:26,444 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:26,444 INFO L513 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] [2021-11-07 02:08:26,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-07 02:08:26,445 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:26,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:26,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1095271655, now seen corresponding path program 1 times [2021-11-07 02:08:26,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:26,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554036032] [2021-11-07 02:08:26,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:26,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:26,482 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:26,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554036032] [2021-11-07 02:08:26,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554036032] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:26,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:26,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:08:26,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669103807] [2021-11-07 02:08:26,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:08:26,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:08:26,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:08:26,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:08:26,485 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:26,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:26,539 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2021-11-07 02:08:26,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:08:26,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-07 02:08:26,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:26,542 INFO L225 Difference]: With dead ends: 225 [2021-11-07 02:08:26,542 INFO L226 Difference]: Without dead ends: 155 [2021-11-07 02:08:26,542 INFO L786 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 [2021-11-07 02:08:26,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-11-07 02:08:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 125. [2021-11-07 02:08:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 123 states have (on average 1.1300813008130082) internal successors, (139), 124 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2021-11-07 02:08:26,570 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 38 [2021-11-07 02:08:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:26,571 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions. [2021-11-07 02:08:26,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions. [2021-11-07 02:08:26,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-07 02:08:26,572 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:26,572 INFO L513 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] [2021-11-07 02:08:26,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-07 02:08:26,574 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-11-07 02:08:26,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:26,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1099571465, now seen corresponding path program 1 times [2021-11-07 02:08:26,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:08:26,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223735567] [2021-11-07 02:08:26,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:26,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:08:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:08:26,601 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 02:08:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:08:26,718 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 02:08:26,719 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 02:08:26,720 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,726 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,726 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,726 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,728 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,728 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,728 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,728 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,729 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,729 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,729 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,729 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,730 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,730 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,730 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:08:26,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-07 02:08:26,740 INFO L731 BasicCegarLoop]: Path program 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] [2021-11-07 02:08:26,745 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 02:08:26,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:08:26 BoogieIcfgContainer [2021-11-07 02:08:26,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 02:08:26,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 02:08:26,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 02:08:26,916 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 02:08:26,917 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:08:16" (3/4) ... [2021-11-07 02:08:26,919 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 02:08:27,047 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 02:08:27,048 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 02:08:27,050 INFO L168 Benchmark]: Toolchain (without parser) took 14353.94 ms. Allocated memory was 104.9 MB in the beginning and 268.4 MB in the end (delta: 163.6 MB). Free memory was 71.9 MB in the beginning and 86.5 MB in the end (delta: -14.7 MB). Peak memory consumption was 148.6 MB. Max. memory is 16.1 GB. [2021-11-07 02:08:27,050 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 104.9 MB. Free memory is still 58.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:08:27,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.22 ms. Allocated memory was 104.9 MB in the beginning and 132.1 MB in the end (delta: 27.3 MB). Free memory was 71.6 MB in the beginning and 97.8 MB in the end (delta: -26.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 02:08:27,052 INFO L168 Benchmark]: Boogie Procedure Inliner took 167.85 ms. Allocated memory is still 132.1 MB. Free memory was 97.8 MB in the beginning and 90.1 MB in the end (delta: 7.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 02:08:27,052 INFO L168 Benchmark]: Boogie Preprocessor took 114.54 ms. Allocated memory is still 132.1 MB. Free memory was 90.1 MB in the beginning and 85.2 MB in the end (delta: 4.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 02:08:27,053 INFO L168 Benchmark]: RCFGBuilder took 3086.40 ms. Allocated memory is still 132.1 MB. Free memory was 85.2 MB in the beginning and 87.5 MB in the end (delta: -2.4 MB). Peak memory consumption was 54.0 MB. Max. memory is 16.1 GB. [2021-11-07 02:08:27,053 INFO L168 Benchmark]: TraceAbstraction took 10131.34 ms. Allocated memory was 132.1 MB in the beginning and 268.4 MB in the end (delta: 136.3 MB). Free memory was 87.5 MB in the beginning and 100.2 MB in the end (delta: -12.6 MB). Peak memory consumption was 122.5 MB. Max. memory is 16.1 GB. [2021-11-07 02:08:27,054 INFO L168 Benchmark]: Witness Printer took 132.42 ms. Allocated memory is still 268.4 MB. Free memory was 100.2 MB in the beginning and 86.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-07 02:08:27,057 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 104.9 MB. Free memory is still 58.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 711.22 ms. Allocated memory was 104.9 MB in the beginning and 132.1 MB in the end (delta: 27.3 MB). Free memory was 71.6 MB in the beginning and 97.8 MB in the end (delta: -26.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 167.85 ms. Allocated memory is still 132.1 MB. Free memory was 97.8 MB in the beginning and 90.1 MB in the end (delta: 7.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 114.54 ms. Allocated memory is still 132.1 MB. Free memory was 90.1 MB in the beginning and 85.2 MB in the end (delta: 4.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3086.40 ms. Allocated memory is still 132.1 MB. Free memory was 85.2 MB in the beginning and 87.5 MB in the end (delta: -2.4 MB). Peak memory consumption was 54.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10131.34 ms. Allocated memory was 132.1 MB in the beginning and 268.4 MB in the end (delta: 136.3 MB). Free memory was 87.5 MB in the beginning and 100.2 MB in the end (delta: -12.6 MB). Peak memory consumption was 122.5 MB. Max. memory is 16.1 GB. * Witness Printer took 132.42 ms. Allocated memory is still 268.4 MB. Free memory was 100.2 MB in the beginning and 86.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 65]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L36] int FloppyThread ; [L37] int KernelMode ; [L38] int Suspended ; [L39] int Executive ; [L40] int DiskController ; [L41] int FloppyDiskPeripheral ; [L42] int FlConfigCallBack ; [L43] int MaximumInterfaceType ; [L44] int MOUNTDEV_MOUNTED_DEVICE_GUID ; [L45] int myStatus ; [L46] int s ; [L47] int UNLOADED ; [L48] int NP ; [L49] int DC ; [L50] int SKIP1 ; [L51] int SKIP2 ; [L52] int MPR1 ; [L53] int MPR3 ; [L54] int IPC ; [L55] int pended ; [L56] int compRegistered ; [L57] int lowerDriverReturn ; [L58] int setEventCalled ; [L59] int customIrp ; [L91] int PagingReferenceCount = 0; [L92] int PagingMutex = 0; [L671] int status ; [L672] int irp = __VERIFIER_nondet_int() ; [L673] int pirp ; [L674] int pirp__IoStatus__Status ; [L675] int irp_choice = __VERIFIER_nondet_int() ; [L676] int devobj = __VERIFIER_nondet_int() ; [L677] int __cil_tmp8 ; [L679] FloppyThread = 0 [L680] KernelMode = 0 [L681] Suspended = 0 [L682] Executive = 0 [L683] DiskController = 0 [L684] FloppyDiskPeripheral = 0 [L685] FlConfigCallBack = 0 [L686] MaximumInterfaceType = 0 [L687] MOUNTDEV_MOUNTED_DEVICE_GUID = 0 [L688] myStatus = 0 [L689] s = 0 [L690] UNLOADED = 0 [L691] NP = 0 [L692] DC = 0 [L693] SKIP1 = 0 [L694] SKIP2 = 0 [L695] MPR1 = 0 [L696] MPR3 = 0 [L697] IPC = 0 [L698] pended = 0 [L699] compRegistered = 0 [L700] lowerDriverReturn = 0 [L701] setEventCalled = 0 [L702] customIrp = 0 [L706] status = 0 [L707] pirp = irp [L74] UNLOADED = 0 [L75] NP = 1 [L76] DC = 2 [L77] SKIP1 = 3 [L78] SKIP2 = 4 [L79] MPR1 = 5 [L80] MPR3 = 6 [L81] IPC = 7 [L82] s = UNLOADED [L83] pended = 0 [L84] compRegistered = 0 [L85] lowerDriverReturn = 0 [L86] setEventCalled = 0 [L87] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L710] COND TRUE status >= 0 [L711] s = NP [L712] customIrp = 0 [L713] setEventCalled = customIrp [L714] lowerDriverReturn = setEventCalled [L715] compRegistered = lowerDriverReturn [L716] pended = compRegistered [L717] pirp__IoStatus__Status = 0 [L718] myStatus = 0 [L719] COND TRUE irp_choice == 0 [L720] pirp__IoStatus__Status = -1073741637 [L721] myStatus = -1073741637 [L661] s = NP [L662] pended = 0 [L663] compRegistered = 0 [L664] lowerDriverReturn = 0 [L665] setEventCalled = 0 [L666] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L727] COND FALSE !(status < 0) [L731] int tmp_ndt_1; [L732] tmp_ndt_1 = __VERIFIER_nondet_int() [L733] COND TRUE tmp_ndt_1 == 3 [L164] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L165] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L166] int Irp__IoStatus__Information ; [L167] int Irp__IoStatus__Status ; [L168] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L169] int disketteExtension__IsRemoved = __VERIFIER_nondet_int() ; [L170] int disketteExtension__IsStarted = __VERIFIER_nondet_int() ; [L171] int disketteExtension__TargetObject = __VERIFIER_nondet_int() ; [L172] int disketteExtension__HoldNewRequests ; [L173] int disketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L174] int disketteExtension__InterfaceString__Buffer = __VERIFIER_nondet_int() ; [L175] int disketteExtension__InterfaceString = __VERIFIER_nondet_int() ; [L176] int disketteExtension__ArcName__Length = __VERIFIER_nondet_int() ; [L177] int disketteExtension__ArcName = __VERIFIER_nondet_int() ; [L178] int irpSp__MinorFunction = __VERIFIER_nondet_int() ; [L179] int IoGetConfigurationInformation__FloppyCount = __VERIFIER_nondet_int() ; [L180] int irpSp ; [L181] int disketteExtension ; [L182] int ntStatus ; [L183] int doneEvent = __VERIFIER_nondet_int() ; [L184] int irpSp___0 ; [L185] int nextIrpSp ; [L186] int nextIrpSp__Control ; [L187] int irpSp___1 ; [L188] int irpSp__Context ; [L189] int irpSp__Control ; [L190] long __cil_tmp29 ; [L191] long __cil_tmp30 ; [L194] ntStatus = 0 [L195] PagingReferenceCount ++ [L196] COND TRUE PagingReferenceCount == 1 [L199] disketteExtension = DeviceObject__DeviceExtension [L200] irpSp = Irp__Tail__Overlay__CurrentStackLocation VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L201] COND FALSE !(\read(disketteExtension__IsRemoved)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L210] COND FALSE !(irpSp__MinorFunction == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L213] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L239] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L242] COND FALSE !(! disketteExtension__IsStarted) [L258] disketteExtension__HoldNewRequests = 1 [L101] int status ; [L102] int threadHandle = __VERIFIER_nondet_int() ; [L103] int DisketteExtension__PoweringDown = __VERIFIER_nondet_int() ; [L104] int DisketteExtension__ThreadReferenceCount = __VERIFIER_nondet_int() ; [L105] int DisketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L106] int Irp__IoStatus__Status ; [L107] int Irp__IoStatus__Information ; [L108] int Irp__Tail__Overlay__CurrentStackLocation__Control ; [L109] int ObjAttributes = __VERIFIER_nondet_int() ; [L110] int __cil_tmp12 ; [L111] int __cil_tmp13 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L114] COND FALSE !(DisketteExtension__PoweringDown == 1) [L120] DisketteExtension__ThreadReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L121] COND FALSE !(DisketteExtension__ThreadReferenceCount == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L153] COND TRUE pended == 0 [L154] pended = 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L160] return (259); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L259] ntStatus = FlQueueIrpToThread(Irp, disketteExtension) [L262] __cil_tmp29 = (long )ntStatus VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L263] COND TRUE __cil_tmp29 == 259L [L1036] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1045] COND FALSE !(customIrp == 1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1049] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1056] int tmp_ndt_8; [L1057] tmp_ndt_8 = __VERIFIER_nondet_int() [L1058] COND TRUE tmp_ndt_8 == 0 [L1064] return (0); [L268] COND TRUE disketteExtension__FloppyThread != 0 [L271] disketteExtension__FloppyThread = 0 [L272] Irp__IoStatus__Status = 0 [L273] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L274] COND TRUE s == NP [L275] s = SKIP1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L282] Irp__CurrentLocation ++ [L283] Irp__Tail__Overlay__CurrentStackLocation ++ [L938] int returnVal2 ; [L939] int compRetStatus1 ; [L940] int lcontext = __VERIFIER_nondet_int() ; [L941] unsigned long __cil_tmp7 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L944] COND FALSE !(\read(compRegistered)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L957] int tmp_ndt_12; [L958] tmp_ndt_12 = __VERIFIER_nondet_int() [L959] COND FALSE !(tmp_ndt_12 == 0) [L962] int tmp_ndt_7; [L963] tmp_ndt_7 = __VERIFIER_nondet_int() [L964] COND TRUE tmp_ndt_7 == 1 [L973] returnVal2 = -1073741823 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L983] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L987] COND FALSE !(s == MPR1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L996] COND TRUE s == SKIP1 [L997] s = SKIP2 [L998] lowerDriverReturn = returnVal2 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1006] return (returnVal2); [L284] ntStatus = IofCallDriver(disketteExtension__TargetObject, Irp) [L430] PagingReferenceCount -- [L431] COND TRUE PagingReferenceCount == 0 [L434] return (ntStatus); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L740] status = FloppyPnp(devobj, pirp) [L750] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L751] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L758] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L759] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L766] COND TRUE s != UNLOADED VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L767] COND TRUE status != -1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L768] COND FALSE !(s != SKIP2) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L782] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L783] COND TRUE status != 259 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L65] reach_error() VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 258 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 35, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7035 SDtfs, 4766 SDslu, 6893 SDs, 0 SdLazy, 2787 SolverSat, 338 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=6, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 34 MinimizatonAttempts, 612 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 817 NumberOfCodeBlocks, 817 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 744 ConstructedInterpolants, 0 QuantifiedInterpolants, 2099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-07 02:08:27,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8163216-b0f4-4828-9951-0a262c1dc770/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE