./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw --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 bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-20 05:40:38,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-20 05:40:38,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-20 05:40:38,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-20 05:40:38,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-20 05:40:38,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-20 05:40:38,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-20 05:40:38,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-20 05:40:38,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-20 05:40:38,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-20 05:40:38,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-20 05:40:38,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-20 05:40:38,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-20 05:40:38,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-20 05:40:38,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-20 05:40:38,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-20 05:40:38,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-20 05:40:38,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-20 05:40:38,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-20 05:40:38,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-20 05:40:38,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-20 05:40:38,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-20 05:40:38,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-20 05:40:38,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-20 05:40:38,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-20 05:40:38,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-20 05:40:38,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-20 05:40:38,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-20 05:40:38,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-20 05:40:38,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-20 05:40:38,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-20 05:40:38,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-20 05:40:38,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-20 05:40:38,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-20 05:40:38,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-20 05:40:38,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-20 05:40:38,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-20 05:40:38,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-20 05:40:38,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-20 05:40:38,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-20 05:40:38,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-20 05:40:38,249 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-20 05:40:38,306 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-20 05:40:38,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-20 05:40:38,309 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-20 05:40:38,309 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-20 05:40:38,310 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-20 05:40:38,310 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-20 05:40:38,310 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-20 05:40:38,311 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-20 05:40:38,319 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-20 05:40:38,319 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-20 05:40:38,321 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-20 05:40:38,321 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-20 05:40:38,322 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-20 05:40:38,322 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-20 05:40:38,322 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-20 05:40:38,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-20 05:40:38,324 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-20 05:40:38,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-20 05:40:38,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-20 05:40:38,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-20 05:40:38,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-20 05:40:38,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-20 05:40:38,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-20 05:40:38,326 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-20 05:40:38,326 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-20 05:40:38,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-20 05:40:38,327 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-20 05:40:38,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-20 05:40:38,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-20 05:40:38,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-20 05:40:38,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-20 05:40:38,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-20 05:40:38,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-20 05:40:38,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-20 05:40:38,330 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-20 05:40:38,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-20 05:40:38,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-20 05:40:38,331 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-20 05:40:38,331 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-20 05:40:38,331 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_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/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_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw 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 -> bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 [2021-10-20 05:40:38,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-20 05:40:38,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-20 05:40:38,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-20 05:40:38,718 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-20 05:40:38,719 INFO L275 PluginConnector]: CDTParser initialized [2021-10-20 05:40:38,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-10-20 05:40:38,796 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/data/82fc570f6/5d0797b15dcb4fce95668eeb632a2d7a/FLAG2c3856444 [2021-10-20 05:40:39,546 INFO L306 CDTParser]: Found 1 translation units. [2021-10-20 05:40:39,547 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-10-20 05:40:39,600 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/data/82fc570f6/5d0797b15dcb4fce95668eeb632a2d7a/FLAG2c3856444 [2021-10-20 05:40:39,717 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/data/82fc570f6/5d0797b15dcb4fce95668eeb632a2d7a [2021-10-20 05:40:39,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-20 05:40:39,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-20 05:40:39,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-20 05:40:39,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-20 05:40:39,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-20 05:40:39,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:40:39" (1/1) ... [2021-10-20 05:40:39,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e32b18a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:40:39, skipping insertion in model container [2021-10-20 05:40:39,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:40:39" (1/1) ... [2021-10-20 05:40:39,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-20 05:40:39,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-20 05:40:40,139 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_fdd53f6d-2565-4e20-91f5-1326bb2d296d/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-10-20 05:40:40,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-20 05:40:40,424 INFO L203 MainTranslator]: Completed pre-run [2021-10-20 05:40:40,444 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_fdd53f6d-2565-4e20-91f5-1326bb2d296d/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-10-20 05:40:40,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-20 05:40:40,652 INFO L208 MainTranslator]: Completed translation [2021-10-20 05:40:40,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:40:40 WrapperNode [2021-10-20 05:40:40,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-20 05:40:40,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-20 05:40:40,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-20 05:40:40,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-20 05:40:40,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:40:40" (1/1) ... [2021-10-20 05:40:40,722 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:40:40" (1/1) ... [2021-10-20 05:40:40,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-20 05:40:40,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-20 05:40:40,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-20 05:40:40,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-20 05:40:40,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:40:40" (1/1) ... [2021-10-20 05:40:40,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:40:40" (1/1) ... [2021-10-20 05:40:40,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:40:40" (1/1) ... [2021-10-20 05:40:40,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:40:40" (1/1) ... [2021-10-20 05:40:41,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:40:40" (1/1) ... [2021-10-20 05:40:41,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:40:40" (1/1) ... [2021-10-20 05:40:41,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:40:40" (1/1) ... [2021-10-20 05:40:41,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-20 05:40:41,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-20 05:40:41,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-20 05:40:41,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-20 05:40:41,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:40:40" (1/1) ... [2021-10-20 05:40:41,245 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-20 05:40:41,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/z3 [2021-10-20 05:40:41,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-20 05:40:41,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-20 05:40:41,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-20 05:40:41,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-20 05:40:41,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-20 05:40:41,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-20 05:40:41,751 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,753 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,766 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,772 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,779 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,785 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,792 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,801 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,805 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,809 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,812 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,816 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,821 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,828 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,830 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,834 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,839 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,842 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,845 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,875 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,877 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,880 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,883 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,886 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,887 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,891 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,895 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,898 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,902 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,906 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,909 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,913 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,914 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,918 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,919 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,923 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,924 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,927 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,929 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,932 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,934 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,937 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:41,941 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-20 05:40:44,437 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1271: assume false; [2021-10-20 05:40:44,438 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1272: assume !false; [2021-10-20 05:40:44,438 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-10-20 05:40:44,439 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-10-20 05:40:44,439 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1230: assume !false; [2021-10-20 05:40:44,439 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##287: assume false; [2021-10-20 05:40:44,440 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##288: assume !false; [2021-10-20 05:40:44,440 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1229: assume false; [2021-10-20 05:40:44,440 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1210: assume false; [2021-10-20 05:40:44,440 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1211: assume !false; [2021-10-20 05:40:44,440 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##319: assume false; [2021-10-20 05:40:44,441 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##320: assume !false; [2021-10-20 05:40:44,441 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1160: assume !false; [2021-10-20 05:40:44,441 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1159: assume false; [2021-10-20 05:40:44,441 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##371: assume false; [2021-10-20 05:40:44,442 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##372: assume !false; [2021-10-20 05:40:44,442 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1108: assume false; [2021-10-20 05:40:44,442 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1109: assume !false; [2021-10-20 05:40:44,442 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##346: assume false; [2021-10-20 05:40:44,442 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##347: assume !false; [2021-10-20 05:40:44,443 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume false; [2021-10-20 05:40:44,443 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##417: assume !false; [2021-10-20 05:40:44,443 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1050: assume !false; [2021-10-20 05:40:44,443 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res := 0; [2021-10-20 05:40:44,444 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1049: assume false; [2021-10-20 05:40:44,444 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1003: assume false; [2021-10-20 05:40:44,444 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1004: assume !false; [2021-10-20 05:40:44,444 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##461: assume !false; [2021-10-20 05:40:44,445 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##460: assume false; [2021-10-20 05:40:44,445 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##487: assume !false; [2021-10-20 05:40:44,445 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##486: assume false; [2021-10-20 05:40:44,445 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##526: assume !false; [2021-10-20 05:40:44,445 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##525: assume false; [2021-10-20 05:40:44,446 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume !false; [2021-10-20 05:40:44,446 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##70: assume false; [2021-10-20 05:40:44,446 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2021-10-20 05:40:44,446 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2021-10-20 05:40:44,447 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2021-10-20 05:40:44,447 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2021-10-20 05:40:44,448 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-10-20 05:40:44,449 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-10-20 05:40:44,449 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##573: assume !false; [2021-10-20 05:40:44,450 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##572: assume false; [2021-10-20 05:40:44,450 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##685: assume !false; [2021-10-20 05:40:44,451 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume false; [2021-10-20 05:40:44,451 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-10-20 05:40:44,451 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-10-20 05:40:44,452 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume !false; [2021-10-20 05:40:44,452 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##638: assume false; [2021-10-20 05:40:44,452 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1612: assume false; [2021-10-20 05:40:44,452 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1613: assume !false; [2021-10-20 05:40:44,453 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##757: assume !false; [2021-10-20 05:40:44,453 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##756: assume false; [2021-10-20 05:40:44,453 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##717: assume !false; [2021-10-20 05:40:44,453 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##716: assume false; [2021-10-20 05:40:44,454 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1506: assume false; [2021-10-20 05:40:44,454 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1507: assume !false; [2021-10-20 05:40:44,454 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1564: assume false; [2021-10-20 05:40:44,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1565: assume !false; [2021-10-20 05:40:44,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##856: assume false; [2021-10-20 05:40:44,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##857: assume !false; [2021-10-20 05:40:44,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##801: assume false; [2021-10-20 05:40:44,456 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##802: assume !false; [2021-10-20 05:40:44,457 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##832: assume !false; [2021-10-20 05:40:44,457 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##831: assume false; [2021-10-20 05:40:44,461 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1426: assume false; [2021-10-20 05:40:44,461 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1427: assume !false; [2021-10-20 05:40:44,462 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1476: assume false; [2021-10-20 05:40:44,462 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1477: assume !false; [2021-10-20 05:40:44,462 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1398: assume false; [2021-10-20 05:40:44,463 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1399: assume !false; [2021-10-20 05:40:44,464 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##961: assume !false; [2021-10-20 05:40:44,464 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##960: assume false; [2021-10-20 05:40:44,465 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##909: assume false; [2021-10-20 05:40:44,472 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##910: assume !false; [2021-10-20 05:40:44,473 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1301: assume false; [2021-10-20 05:40:44,473 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1302: assume !false; [2021-10-20 05:40:44,473 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##188: assume !false; [2021-10-20 05:40:44,473 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume false; [2021-10-20 05:40:44,473 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##148: assume false; [2021-10-20 05:40:44,474 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##149: assume !false; [2021-10-20 05:40:44,474 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1354: assume false; [2021-10-20 05:40:44,474 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1355: assume !false; [2021-10-20 05:40:44,474 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1341: assume false; [2021-10-20 05:40:44,474 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1342: assume !false; [2021-10-20 05:40:44,475 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume false; [2021-10-20 05:40:44,475 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !false; [2021-10-20 05:40:47,612 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-20 05:40:47,613 INFO L299 CfgBuilder]: Removed 555 assume(true) statements. [2021-10-20 05:40:47,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:40:47 BoogieIcfgContainer [2021-10-20 05:40:47,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-20 05:40:47,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-20 05:40:47,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-20 05:40:47,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-20 05:40:47,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 05:40:39" (1/3) ... [2021-10-20 05:40:47,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0700f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:40:47, skipping insertion in model container [2021-10-20 05:40:47,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:40:40" (2/3) ... [2021-10-20 05:40:47,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0700f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:40:47, skipping insertion in model container [2021-10-20 05:40:47,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:40:47" (3/3) ... [2021-10-20 05:40:47,631 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2021-10-20 05:40:47,638 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-20 05:40:47,638 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 103 error locations. [2021-10-20 05:40:47,755 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-20 05:40:47,763 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-10-20 05:40:47,763 INFO L340 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2021-10-20 05:40:47,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 779 states, 675 states have (on average 1.7377777777777779) internal successors, (1173), 778 states have internal predecessors, (1173), 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-10-20 05:40:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-20 05:40:47,827 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:47,840 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-20 05:40:47,841 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:47,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:47,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1428884645, now seen corresponding path program 1 times [2021-10-20 05:40:47,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:47,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860716305] [2021-10-20 05:40:47,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:47,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:48,157 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:48,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860716305] [2021-10-20 05:40:48,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860716305] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:48,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:48,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:48,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550931563] [2021-10-20 05:40:48,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-20 05:40:48,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:48,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-20 05:40:48,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:48,202 INFO L87 Difference]: Start difference. First operand has 779 states, 675 states have (on average 1.7377777777777779) internal successors, (1173), 778 states have internal predecessors, (1173), 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.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-10-20 05:40:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:48,933 INFO L93 Difference]: Finished difference Result 1301 states and 1928 transitions. [2021-10-20 05:40:48,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-20 05:40:48,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2021-10-20 05:40:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:48,975 INFO L225 Difference]: With dead ends: 1301 [2021-10-20 05:40:48,976 INFO L226 Difference]: Without dead ends: 736 [2021-10-20 05:40:48,989 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:49,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2021-10-20 05:40:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 734. [2021-10-20 05:40:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 667 states have (on average 1.5412293853073464) internal successors, (1028), 733 states have internal predecessors, (1028), 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-10-20 05:40:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1028 transitions. [2021-10-20 05:40:49,119 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1028 transitions. Word has length 8 [2021-10-20 05:40:49,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:49,120 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1028 transitions. [2021-10-20 05:40:49,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-10-20 05:40:49,120 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1028 transitions. [2021-10-20 05:40:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-20 05:40:49,122 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:49,122 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-20 05:40:49,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-20 05:40:49,123 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:49,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:49,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1293410765, now seen corresponding path program 1 times [2021-10-20 05:40:49,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:49,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152410242] [2021-10-20 05:40:49,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:49,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:49,246 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:49,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152410242] [2021-10-20 05:40:49,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152410242] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:49,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:49,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:49,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844233007] [2021-10-20 05:40:49,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-20 05:40:49,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:49,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-20 05:40:49,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:49,251 INFO L87 Difference]: Start difference. First operand 734 states and 1028 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-10-20 05:40:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:49,329 INFO L93 Difference]: Finished difference Result 931 states and 1280 transitions. [2021-10-20 05:40:49,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-20 05:40:49,330 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-10-20 05:40:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:49,342 INFO L225 Difference]: With dead ends: 931 [2021-10-20 05:40:49,343 INFO L226 Difference]: Without dead ends: 734 [2021-10-20 05:40:49,344 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:49,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2021-10-20 05:40:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 629. [2021-10-20 05:40:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 583 states have (on average 1.5214408233276158) internal successors, (887), 628 states have internal predecessors, (887), 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-10-20 05:40:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 887 transitions. [2021-10-20 05:40:49,394 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 887 transitions. Word has length 9 [2021-10-20 05:40:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:49,395 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 887 transitions. [2021-10-20 05:40:49,395 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-10-20 05:40:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 887 transitions. [2021-10-20 05:40:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-20 05:40:49,398 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:49,398 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-20 05:40:49,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-20 05:40:49,399 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:49,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:49,400 INFO L82 PathProgramCache]: Analyzing trace with hash -224003595, now seen corresponding path program 1 times [2021-10-20 05:40:49,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:49,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982365252] [2021-10-20 05:40:49,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:49,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:49,449 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:49,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982365252] [2021-10-20 05:40:49,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982365252] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:49,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:49,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-20 05:40:49,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252559781] [2021-10-20 05:40:49,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-20 05:40:49,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:49,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-20 05:40:49,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:49,453 INFO L87 Difference]: Start difference. First operand 629 states and 887 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-10-20 05:40:49,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:49,849 INFO L93 Difference]: Finished difference Result 651 states and 912 transitions. [2021-10-20 05:40:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-20 05:40:49,849 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-10-20 05:40:49,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:49,855 INFO L225 Difference]: With dead ends: 651 [2021-10-20 05:40:49,855 INFO L226 Difference]: Without dead ends: 629 [2021-10-20 05:40:49,856 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-10-20 05:40:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2021-10-20 05:40:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 583 states have (on average 1.5197255574614066) internal successors, (886), 628 states have internal predecessors, (886), 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-10-20 05:40:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 886 transitions. [2021-10-20 05:40:49,892 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 886 transitions. Word has length 10 [2021-10-20 05:40:49,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:49,893 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 886 transitions. [2021-10-20 05:40:49,894 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-10-20 05:40:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 886 transitions. [2021-10-20 05:40:49,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-20 05:40:49,906 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:49,906 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-20 05:40:49,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-20 05:40:49,908 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:49,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:49,909 INFO L82 PathProgramCache]: Analyzing trace with hash 725022092, now seen corresponding path program 1 times [2021-10-20 05:40:49,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:49,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142936384] [2021-10-20 05:40:49,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:49,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:49,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:49,994 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:49,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142936384] [2021-10-20 05:40:49,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142936384] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:49,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:49,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:49,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868362542] [2021-10-20 05:40:49,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-20 05:40:49,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:49,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-20 05:40:49,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:49,999 INFO L87 Difference]: Start difference. First operand 629 states and 886 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-20 05:40:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:50,540 INFO L93 Difference]: Finished difference Result 1041 states and 1426 transitions. [2021-10-20 05:40:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-20 05:40:50,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2021-10-20 05:40:50,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:50,548 INFO L225 Difference]: With dead ends: 1041 [2021-10-20 05:40:50,548 INFO L226 Difference]: Without dead ends: 874 [2021-10-20 05:40:50,549 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:50,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-10-20 05:40:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 742. [2021-10-20 05:40:50,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 696 states have (on average 1.5172413793103448) internal successors, (1056), 741 states have internal predecessors, (1056), 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-10-20 05:40:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1056 transitions. [2021-10-20 05:40:50,590 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1056 transitions. Word has length 12 [2021-10-20 05:40:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:50,590 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 1056 transitions. [2021-10-20 05:40:50,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-20 05:40:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1056 transitions. [2021-10-20 05:40:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-20 05:40:50,592 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:50,593 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-20 05:40:50,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-20 05:40:50,593 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:50,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:50,594 INFO L82 PathProgramCache]: Analyzing trace with hash 993192964, now seen corresponding path program 1 times [2021-10-20 05:40:50,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:50,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821173187] [2021-10-20 05:40:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:50,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:50,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-10-20 05:40:50,662 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:50,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821173187] [2021-10-20 05:40:50,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821173187] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:50,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:50,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:50,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894666918] [2021-10-20 05:40:50,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-20 05:40:50,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:50,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-20 05:40:50,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-20 05:40:50,665 INFO L87 Difference]: Start difference. First operand 742 states and 1056 transitions. Second operand has 4 states, 4 states have (on average 3.25) 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-10-20 05:40:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:51,113 INFO L93 Difference]: Finished difference Result 1044 states and 1448 transitions. [2021-10-20 05:40:51,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-20 05:40:51,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) 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-10-20 05:40:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:51,119 INFO L225 Difference]: With dead ends: 1044 [2021-10-20 05:40:51,119 INFO L226 Difference]: Without dead ends: 629 [2021-10-20 05:40:51,121 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:40:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-10-20 05:40:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 580. [2021-10-20 05:40:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 556 states have (on average 1.4388489208633093) internal successors, (800), 579 states have internal predecessors, (800), 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-10-20 05:40:51,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 800 transitions. [2021-10-20 05:40:51,165 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 800 transitions. Word has length 13 [2021-10-20 05:40:51,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:51,165 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 800 transitions. [2021-10-20 05:40:51,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) 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-10-20 05:40:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 800 transitions. [2021-10-20 05:40:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-20 05:40:51,167 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:51,167 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-20 05:40:51,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-20 05:40:51,168 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:51,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1649645807, now seen corresponding path program 1 times [2021-10-20 05:40:51,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:51,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316338324] [2021-10-20 05:40:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:51,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:51,274 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:51,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316338324] [2021-10-20 05:40:51,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316338324] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:51,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:51,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:51,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189435609] [2021-10-20 05:40:51,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-20 05:40:51,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:51,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-20 05:40:51,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:51,277 INFO L87 Difference]: Start difference. First operand 580 states and 800 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10-20 05:40:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:51,570 INFO L93 Difference]: Finished difference Result 580 states and 800 transitions. [2021-10-20 05:40:51,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-20 05:40:51,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2021-10-20 05:40:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:51,575 INFO L225 Difference]: With dead ends: 580 [2021-10-20 05:40:51,575 INFO L226 Difference]: Without dead ends: 562 [2021-10-20 05:40:51,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-10-20 05:40:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-10-20 05:40:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 547 states have (on average 1.429616087751371) internal successors, (782), 561 states have internal predecessors, (782), 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-10-20 05:40:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 782 transitions. [2021-10-20 05:40:51,614 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 782 transitions. Word has length 14 [2021-10-20 05:40:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:51,615 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 782 transitions. [2021-10-20 05:40:51,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10-20 05:40:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 782 transitions. [2021-10-20 05:40:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-20 05:40:51,617 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:51,617 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-20 05:40:51,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-20 05:40:51,617 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:51,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:51,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1629262432, now seen corresponding path program 1 times [2021-10-20 05:40:51,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:51,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748914343] [2021-10-20 05:40:51,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:51,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:51,719 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:51,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748914343] [2021-10-20 05:40:51,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748914343] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:51,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:51,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-20 05:40:51,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133550549] [2021-10-20 05:40:51,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-20 05:40:51,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:51,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-20 05:40:51,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-20 05:40:51,722 INFO L87 Difference]: Start difference. First operand 562 states and 782 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-10-20 05:40:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:51,819 INFO L93 Difference]: Finished difference Result 758 states and 1034 transitions. [2021-10-20 05:40:51,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-20 05:40:51,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2021-10-20 05:40:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:51,825 INFO L225 Difference]: With dead ends: 758 [2021-10-20 05:40:51,825 INFO L226 Difference]: Without dead ends: 613 [2021-10-20 05:40:51,826 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:40:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-10-20 05:40:51,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 552. [2021-10-20 05:40:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 539 states have (on average 1.4211502782931353) internal successors, (766), 551 states have internal predecessors, (766), 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-10-20 05:40:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 766 transitions. [2021-10-20 05:40:51,867 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 766 transitions. Word has length 14 [2021-10-20 05:40:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:51,867 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 766 transitions. [2021-10-20 05:40:51,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-10-20 05:40:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 766 transitions. [2021-10-20 05:40:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-20 05:40:51,869 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:51,870 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-20 05:40:51,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-20 05:40:51,870 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:51,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:51,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1145033940, now seen corresponding path program 1 times [2021-10-20 05:40:51,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:51,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457376696] [2021-10-20 05:40:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:51,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:51,941 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:51,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457376696] [2021-10-20 05:40:51,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457376696] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:51,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:51,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:51,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116226895] [2021-10-20 05:40:51,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-20 05:40:51,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:51,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-20 05:40:51,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:51,943 INFO L87 Difference]: Start difference. First operand 552 states and 766 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-10-20 05:40:52,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:52,043 INFO L93 Difference]: Finished difference Result 606 states and 829 transitions. [2021-10-20 05:40:52,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-20 05:40:52,044 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-10-20 05:40:52,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:52,049 INFO L225 Difference]: With dead ends: 606 [2021-10-20 05:40:52,049 INFO L226 Difference]: Without dead ends: 583 [2021-10-20 05:40:52,049 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:52,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-10-20 05:40:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 572. [2021-10-20 05:40:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 560 states have (on average 1.4160714285714286) internal successors, (793), 571 states have internal predecessors, (793), 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-10-20 05:40:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 793 transitions. [2021-10-20 05:40:52,088 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 793 transitions. Word has length 17 [2021-10-20 05:40:52,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:52,088 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 793 transitions. [2021-10-20 05:40:52,089 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-10-20 05:40:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 793 transitions. [2021-10-20 05:40:52,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-20 05:40:52,091 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:52,091 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-20 05:40:52,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-20 05:40:52,091 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:52,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:52,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1721362675, now seen corresponding path program 1 times [2021-10-20 05:40:52,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:52,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915530732] [2021-10-20 05:40:52,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:52,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:52,139 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:52,139 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915530732] [2021-10-20 05:40:52,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915530732] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:52,139 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:52,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:52,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927871016] [2021-10-20 05:40:52,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-20 05:40:52,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:52,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-20 05:40:52,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:52,141 INFO L87 Difference]: Start difference. First operand 572 states and 793 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-10-20 05:40:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:52,433 INFO L93 Difference]: Finished difference Result 700 states and 965 transitions. [2021-10-20 05:40:52,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-20 05:40:52,434 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-10-20 05:40:52,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:52,438 INFO L225 Difference]: With dead ends: 700 [2021-10-20 05:40:52,439 INFO L226 Difference]: Without dead ends: 562 [2021-10-20 05:40:52,440 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:52,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-10-20 05:40:52,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-10-20 05:40:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 553 states have (on average 1.406871609403255) internal successors, (778), 561 states have internal predecessors, (778), 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-10-20 05:40:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 778 transitions. [2021-10-20 05:40:52,481 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 778 transitions. Word has length 19 [2021-10-20 05:40:52,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:52,482 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 778 transitions. [2021-10-20 05:40:52,482 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-10-20 05:40:52,482 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 778 transitions. [2021-10-20 05:40:52,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-20 05:40:52,484 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:52,485 INFO L512 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-10-20 05:40:52,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-20 05:40:52,485 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:52,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:52,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1713187916, now seen corresponding path program 1 times [2021-10-20 05:40:52,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:52,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945162946] [2021-10-20 05:40:52,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:52,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:52,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-10-20 05:40:52,525 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:52,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945162946] [2021-10-20 05:40:52,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945162946] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:52,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:52,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:52,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323658120] [2021-10-20 05:40:52,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-20 05:40:52,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:52,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-20 05:40:52,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:52,527 INFO L87 Difference]: Start difference. First operand 562 states and 778 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-10-20 05:40:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:52,812 INFO L93 Difference]: Finished difference Result 689 states and 939 transitions. [2021-10-20 05:40:52,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-20 05:40:52,812 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-10-20 05:40:52,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:52,818 INFO L225 Difference]: With dead ends: 689 [2021-10-20 05:40:52,818 INFO L226 Difference]: Without dead ends: 673 [2021-10-20 05:40:52,819 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-10-20 05:40:52,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 597. [2021-10-20 05:40:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 588 states have (on average 1.3894557823129252) internal successors, (817), 596 states have internal predecessors, (817), 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-10-20 05:40:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 817 transitions. [2021-10-20 05:40:52,862 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 817 transitions. Word has length 21 [2021-10-20 05:40:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:52,862 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 817 transitions. [2021-10-20 05:40:52,862 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-10-20 05:40:52,863 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 817 transitions. [2021-10-20 05:40:52,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-20 05:40:52,865 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:52,865 INFO L512 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-10-20 05:40:52,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-20 05:40:52,865 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:52,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:52,866 INFO L82 PathProgramCache]: Analyzing trace with hash -884532789, now seen corresponding path program 1 times [2021-10-20 05:40:52,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:52,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907028427] [2021-10-20 05:40:52,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:52,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:52,908 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:52,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907028427] [2021-10-20 05:40:52,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907028427] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:52,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:52,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:52,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423228828] [2021-10-20 05:40:52,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-20 05:40:52,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:52,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-20 05:40:52,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:52,911 INFO L87 Difference]: Start difference. First operand 597 states and 817 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) 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-10-20 05:40:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:53,183 INFO L93 Difference]: Finished difference Result 621 states and 843 transitions. [2021-10-20 05:40:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-20 05:40:53,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) 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-10-20 05:40:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:53,189 INFO L225 Difference]: With dead ends: 621 [2021-10-20 05:40:53,189 INFO L226 Difference]: Without dead ends: 616 [2021-10-20 05:40:53,190 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2021-10-20 05:40:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2021-10-20 05:40:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 604 states have (on average 1.3841059602649006) internal successors, (836), 612 states have internal predecessors, (836), 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-10-20 05:40:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 836 transitions. [2021-10-20 05:40:53,234 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 836 transitions. Word has length 22 [2021-10-20 05:40:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:53,236 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 836 transitions. [2021-10-20 05:40:53,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) 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-10-20 05:40:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 836 transitions. [2021-10-20 05:40:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-20 05:40:53,238 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:53,238 INFO L512 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-10-20 05:40:53,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-20 05:40:53,240 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:53,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:53,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1586442508, now seen corresponding path program 1 times [2021-10-20 05:40:53,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:53,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024910532] [2021-10-20 05:40:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:53,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:53,295 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:53,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024910532] [2021-10-20 05:40:53,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024910532] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:53,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:53,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:53,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496306515] [2021-10-20 05:40:53,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-20 05:40:53,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:53,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-20 05:40:53,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-20 05:40:53,298 INFO L87 Difference]: Start difference. First operand 613 states and 836 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-10-20 05:40:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:53,712 INFO L93 Difference]: Finished difference Result 703 states and 953 transitions. [2021-10-20 05:40:53,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-20 05:40:53,713 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-10-20 05:40:53,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:53,718 INFO L225 Difference]: With dead ends: 703 [2021-10-20 05:40:53,718 INFO L226 Difference]: Without dead ends: 691 [2021-10-20 05:40:53,719 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:40:53,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2021-10-20 05:40:53,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 613. [2021-10-20 05:40:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 604 states have (on average 1.380794701986755) internal successors, (834), 612 states have internal predecessors, (834), 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-10-20 05:40:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 834 transitions. [2021-10-20 05:40:53,764 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 834 transitions. Word has length 22 [2021-10-20 05:40:53,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:53,764 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 834 transitions. [2021-10-20 05:40:53,764 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-10-20 05:40:53,765 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 834 transitions. [2021-10-20 05:40:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-20 05:40:53,768 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:53,768 INFO L512 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-10-20 05:40:53,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-20 05:40:53,768 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:53,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:53,769 INFO L82 PathProgramCache]: Analyzing trace with hash 640427871, now seen corresponding path program 1 times [2021-10-20 05:40:53,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:53,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507739351] [2021-10-20 05:40:53,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:53,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:53,821 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:53,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507739351] [2021-10-20 05:40:53,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507739351] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:53,821 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:53,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:53,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273633596] [2021-10-20 05:40:53,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-20 05:40:53,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:53,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-20 05:40:53,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-20 05:40:53,823 INFO L87 Difference]: Start difference. First operand 613 states and 834 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-10-20 05:40:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:54,186 INFO L93 Difference]: Finished difference Result 648 states and 870 transitions. [2021-10-20 05:40:54,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-20 05:40:54,187 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-10-20 05:40:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:54,192 INFO L225 Difference]: With dead ends: 648 [2021-10-20 05:40:54,192 INFO L226 Difference]: Without dead ends: 613 [2021-10-20 05:40:54,192 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:40:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-10-20 05:40:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2021-10-20 05:40:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 604 states have (on average 1.3658940397350994) internal successors, (825), 612 states have internal predecessors, (825), 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-10-20 05:40:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 825 transitions. [2021-10-20 05:40:54,238 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 825 transitions. Word has length 22 [2021-10-20 05:40:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:54,239 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 825 transitions. [2021-10-20 05:40:54,239 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-10-20 05:40:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 825 transitions. [2021-10-20 05:40:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-20 05:40:54,241 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:54,241 INFO L512 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-10-20 05:40:54,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-20 05:40:54,242 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:54,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:54,242 INFO L82 PathProgramCache]: Analyzing trace with hash 162403822, now seen corresponding path program 1 times [2021-10-20 05:40:54,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:54,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605965918] [2021-10-20 05:40:54,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:54,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:54,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:54,283 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:54,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605965918] [2021-10-20 05:40:54,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605965918] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:54,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:54,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:54,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506184180] [2021-10-20 05:40:54,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-20 05:40:54,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:54,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-20 05:40:54,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:54,285 INFO L87 Difference]: Start difference. First operand 613 states and 825 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) 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-10-20 05:40:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:54,345 INFO L93 Difference]: Finished difference Result 665 states and 890 transitions. [2021-10-20 05:40:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-20 05:40:54,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) 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-10-20 05:40:54,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:54,350 INFO L225 Difference]: With dead ends: 665 [2021-10-20 05:40:54,350 INFO L226 Difference]: Without dead ends: 596 [2021-10-20 05:40:54,351 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:54,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-10-20 05:40:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2021-10-20 05:40:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3537414965986394) internal successors, (796), 595 states have internal predecessors, (796), 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-10-20 05:40:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 796 transitions. [2021-10-20 05:40:54,397 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 796 transitions. Word has length 22 [2021-10-20 05:40:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:54,398 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 796 transitions. [2021-10-20 05:40:54,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) 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-10-20 05:40:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 796 transitions. [2021-10-20 05:40:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-20 05:40:54,401 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:54,401 INFO L512 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-10-20 05:40:54,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-20 05:40:54,401 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:54,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2130497339, now seen corresponding path program 1 times [2021-10-20 05:40:54,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:54,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393210549] [2021-10-20 05:40:54,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:54,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:54,456 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:54,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393210549] [2021-10-20 05:40:54,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393210549] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:54,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:54,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-20 05:40:54,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343363400] [2021-10-20 05:40:54,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-20 05:40:54,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:54,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-20 05:40:54,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-20 05:40:54,459 INFO L87 Difference]: Start difference. First operand 596 states and 796 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-10-20 05:40:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:54,544 INFO L93 Difference]: Finished difference Result 712 states and 942 transitions. [2021-10-20 05:40:54,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-20 05:40:54,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-10-20 05:40:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:54,550 INFO L225 Difference]: With dead ends: 712 [2021-10-20 05:40:54,550 INFO L226 Difference]: Without dead ends: 638 [2021-10-20 05:40:54,551 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:40:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-10-20 05:40:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 588. [2021-10-20 05:40:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 582 states have (on average 1.3470790378006874) internal successors, (784), 587 states have internal predecessors, (784), 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-10-20 05:40:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 784 transitions. [2021-10-20 05:40:54,598 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 784 transitions. Word has length 22 [2021-10-20 05:40:54,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:54,599 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 784 transitions. [2021-10-20 05:40:54,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-10-20 05:40:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 784 transitions. [2021-10-20 05:40:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-20 05:40:54,601 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:54,602 INFO L512 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-10-20 05:40:54,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-20 05:40:54,602 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:54,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:54,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1633499935, now seen corresponding path program 1 times [2021-10-20 05:40:54,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:54,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194079688] [2021-10-20 05:40:54,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:54,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:54,655 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:54,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194079688] [2021-10-20 05:40:54,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194079688] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:54,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:54,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:54,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120463462] [2021-10-20 05:40:54,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-20 05:40:54,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-20 05:40:54,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-20 05:40:54,658 INFO L87 Difference]: Start difference. First operand 588 states and 784 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-10-20 05:40:55,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:55,038 INFO L93 Difference]: Finished difference Result 596 states and 790 transitions. [2021-10-20 05:40:55,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-20 05:40:55,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-10-20 05:40:55,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:55,043 INFO L225 Difference]: With dead ends: 596 [2021-10-20 05:40:55,043 INFO L226 Difference]: Without dead ends: 591 [2021-10-20 05:40:55,044 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:40:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-10-20 05:40:55,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 588. [2021-10-20 05:40:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 582 states have (on average 1.3453608247422681) internal successors, (783), 587 states have internal predecessors, (783), 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-10-20 05:40:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 783 transitions. [2021-10-20 05:40:55,108 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 783 transitions. Word has length 23 [2021-10-20 05:40:55,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:55,109 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 783 transitions. [2021-10-20 05:40:55,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-10-20 05:40:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 783 transitions. [2021-10-20 05:40:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-20 05:40:55,112 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:55,112 INFO L512 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-10-20 05:40:55,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-20 05:40:55,113 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:55,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:55,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1412842791, now seen corresponding path program 1 times [2021-10-20 05:40:55,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:55,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501945055] [2021-10-20 05:40:55,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:55,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:55,177 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:55,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501945055] [2021-10-20 05:40:55,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501945055] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:55,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:55,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:55,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256706183] [2021-10-20 05:40:55,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-20 05:40:55,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:55,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-20 05:40:55,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-20 05:40:55,181 INFO L87 Difference]: Start difference. First operand 588 states and 783 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-10-20 05:40:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:55,534 INFO L93 Difference]: Finished difference Result 605 states and 799 transitions. [2021-10-20 05:40:55,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-20 05:40:55,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-10-20 05:40:55,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:55,540 INFO L225 Difference]: With dead ends: 605 [2021-10-20 05:40:55,540 INFO L226 Difference]: Without dead ends: 575 [2021-10-20 05:40:55,541 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:40:55,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-10-20 05:40:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2021-10-20 05:40:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 569 states have (on average 1.3374340949033392) internal successors, (761), 574 states have internal predecessors, (761), 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-10-20 05:40:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 761 transitions. [2021-10-20 05:40:55,606 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 761 transitions. Word has length 23 [2021-10-20 05:40:55,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:55,607 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 761 transitions. [2021-10-20 05:40:55,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-10-20 05:40:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 761 transitions. [2021-10-20 05:40:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-20 05:40:55,610 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:55,610 INFO L512 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-10-20 05:40:55,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-20 05:40:55,610 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:55,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:55,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1360030513, now seen corresponding path program 1 times [2021-10-20 05:40:55,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:55,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414180726] [2021-10-20 05:40:55,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:55,612 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:55,652 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:55,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414180726] [2021-10-20 05:40:55,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414180726] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:55,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:55,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:55,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045113304] [2021-10-20 05:40:55,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-20 05:40:55,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:55,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-20 05:40:55,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:55,657 INFO L87 Difference]: Start difference. First operand 575 states and 761 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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-10-20 05:40:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:55,902 INFO L93 Difference]: Finished difference Result 609 states and 795 transitions. [2021-10-20 05:40:55,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-20 05:40:55,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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-10-20 05:40:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:55,908 INFO L225 Difference]: With dead ends: 609 [2021-10-20 05:40:55,908 INFO L226 Difference]: Without dead ends: 595 [2021-10-20 05:40:55,909 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:40:55,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2021-10-20 05:40:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 583. [2021-10-20 05:40:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 577 states have (on average 1.3327556325823224) internal successors, (769), 582 states have internal predecessors, (769), 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-10-20 05:40:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 769 transitions. [2021-10-20 05:40:55,966 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 769 transitions. Word has length 23 [2021-10-20 05:40:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:55,966 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 769 transitions. [2021-10-20 05:40:55,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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-10-20 05:40:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 769 transitions. [2021-10-20 05:40:55,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-20 05:40:55,969 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:55,969 INFO L512 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-10-20 05:40:55,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-20 05:40:55,969 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:55,970 INFO L82 PathProgramCache]: Analyzing trace with hash 379232346, now seen corresponding path program 1 times [2021-10-20 05:40:55,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:55,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668945129] [2021-10-20 05:40:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:55,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:56,030 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:56,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668945129] [2021-10-20 05:40:56,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668945129] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:56,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:56,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:56,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974985230] [2021-10-20 05:40:56,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-20 05:40:56,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:56,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-20 05:40:56,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-20 05:40:56,034 INFO L87 Difference]: Start difference. First operand 583 states and 769 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-10-20 05:40:56,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:56,309 INFO L93 Difference]: Finished difference Result 591 states and 775 transitions. [2021-10-20 05:40:56,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-20 05:40:56,310 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-10-20 05:40:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:56,314 INFO L225 Difference]: With dead ends: 591 [2021-10-20 05:40:56,314 INFO L226 Difference]: Without dead ends: 586 [2021-10-20 05:40:56,315 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:40:56,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-10-20 05:40:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 583. [2021-10-20 05:40:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 577 states have (on average 1.3310225303292895) internal successors, (768), 582 states have internal predecessors, (768), 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-10-20 05:40:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 768 transitions. [2021-10-20 05:40:56,370 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 768 transitions. Word has length 24 [2021-10-20 05:40:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:56,372 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 768 transitions. [2021-10-20 05:40:56,372 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-10-20 05:40:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 768 transitions. [2021-10-20 05:40:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-20 05:40:56,374 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:56,374 INFO L512 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-10-20 05:40:56,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-20 05:40:56,375 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:56,376 INFO L82 PathProgramCache]: Analyzing trace with hash -771502393, now seen corresponding path program 1 times [2021-10-20 05:40:56,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:56,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836242539] [2021-10-20 05:40:56,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:56,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:56,467 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:56,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836242539] [2021-10-20 05:40:56,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836242539] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:56,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:56,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-20 05:40:56,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776580624] [2021-10-20 05:40:56,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-20 05:40:56,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:56,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-20 05:40:56,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-20 05:40:56,470 INFO L87 Difference]: Start difference. First operand 583 states and 768 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-10-20 05:40:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:56,590 INFO L93 Difference]: Finished difference Result 597 states and 781 transitions. [2021-10-20 05:40:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-20 05:40:56,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-10-20 05:40:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:56,596 INFO L225 Difference]: With dead ends: 597 [2021-10-20 05:40:56,596 INFO L226 Difference]: Without dead ends: 594 [2021-10-20 05:40:56,597 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:40:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-10-20 05:40:56,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 589. [2021-10-20 05:40:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 583 states have (on average 1.3276157804459692) internal successors, (774), 588 states have internal predecessors, (774), 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-10-20 05:40:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 774 transitions. [2021-10-20 05:40:56,652 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 774 transitions. Word has length 24 [2021-10-20 05:40:56,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:56,652 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 774 transitions. [2021-10-20 05:40:56,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-10-20 05:40:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 774 transitions. [2021-10-20 05:40:56,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-20 05:40:56,655 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:56,655 INFO L512 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-10-20 05:40:56,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-20 05:40:56,656 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:56,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:56,657 INFO L82 PathProgramCache]: Analyzing trace with hash -771514309, now seen corresponding path program 1 times [2021-10-20 05:40:56,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:56,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791731903] [2021-10-20 05:40:56,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:56,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:56,722 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:56,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791731903] [2021-10-20 05:40:56,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791731903] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:56,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:56,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:56,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392407246] [2021-10-20 05:40:56,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-20 05:40:56,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:56,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-20 05:40:56,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-20 05:40:56,726 INFO L87 Difference]: Start difference. First operand 589 states and 774 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-10-20 05:40:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:57,055 INFO L93 Difference]: Finished difference Result 603 states and 787 transitions. [2021-10-20 05:40:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-20 05:40:57,056 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-10-20 05:40:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:57,061 INFO L225 Difference]: With dead ends: 603 [2021-10-20 05:40:57,061 INFO L226 Difference]: Without dead ends: 583 [2021-10-20 05:40:57,062 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:40:57,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-10-20 05:40:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 577. [2021-10-20 05:40:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 571 states have (on average 1.3345008756567425) internal successors, (762), 576 states have internal predecessors, (762), 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-10-20 05:40:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 762 transitions. [2021-10-20 05:40:57,114 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 762 transitions. Word has length 24 [2021-10-20 05:40:57,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:57,114 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 762 transitions. [2021-10-20 05:40:57,115 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-10-20 05:40:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 762 transitions. [2021-10-20 05:40:57,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-20 05:40:57,117 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:57,117 INFO L512 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-10-20 05:40:57,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-20 05:40:57,117 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:57,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:57,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1481572040, now seen corresponding path program 1 times [2021-10-20 05:40:57,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:57,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731912246] [2021-10-20 05:40:57,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:57,119 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:57,194 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:57,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731912246] [2021-10-20 05:40:57,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731912246] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:57,195 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:57,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-20 05:40:57,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898811582] [2021-10-20 05:40:57,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-20 05:40:57,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:57,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-20 05:40:57,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-20 05:40:57,198 INFO L87 Difference]: Start difference. First operand 577 states and 762 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-10-20 05:40:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:57,431 INFO L93 Difference]: Finished difference Result 595 states and 779 transitions. [2021-10-20 05:40:57,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-20 05:40:57,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-10-20 05:40:57,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:57,437 INFO L225 Difference]: With dead ends: 595 [2021-10-20 05:40:57,437 INFO L226 Difference]: Without dead ends: 572 [2021-10-20 05:40:57,438 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-20 05:40:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-10-20 05:40:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2021-10-20 05:40:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 566 states have (on average 1.3197879858657244) internal successors, (747), 571 states have internal predecessors, (747), 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-10-20 05:40:57,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 747 transitions. [2021-10-20 05:40:57,489 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 747 transitions. Word has length 25 [2021-10-20 05:40:57,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:57,489 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 747 transitions. [2021-10-20 05:40:57,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-10-20 05:40:57,490 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 747 transitions. [2021-10-20 05:40:57,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-20 05:40:57,492 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:57,492 INFO L512 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-10-20 05:40:57,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-20 05:40:57,493 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:57,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:57,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1652194093, now seen corresponding path program 1 times [2021-10-20 05:40:57,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:57,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796104531] [2021-10-20 05:40:57,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:57,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:57,598 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:57,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796104531] [2021-10-20 05:40:57,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796104531] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:57,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:57,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-20 05:40:57,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123557169] [2021-10-20 05:40:57,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-20 05:40:57,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:57,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-20 05:40:57,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-20 05:40:57,602 INFO L87 Difference]: Start difference. First operand 572 states and 747 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-10-20 05:40:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:57,785 INFO L93 Difference]: Finished difference Result 590 states and 764 transitions. [2021-10-20 05:40:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-20 05:40:57,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-10-20 05:40:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:57,790 INFO L225 Difference]: With dead ends: 590 [2021-10-20 05:40:57,790 INFO L226 Difference]: Without dead ends: 569 [2021-10-20 05:40:57,791 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.6ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-20 05:40:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-10-20 05:40:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2021-10-20 05:40:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 563 states have (on average 1.3019538188277087) internal successors, (733), 568 states have internal predecessors, (733), 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-10-20 05:40:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 733 transitions. [2021-10-20 05:40:57,843 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 733 transitions. Word has length 25 [2021-10-20 05:40:57,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:57,844 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 733 transitions. [2021-10-20 05:40:57,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-10-20 05:40:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 733 transitions. [2021-10-20 05:40:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-20 05:40:57,846 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:57,846 INFO L512 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-10-20 05:40:57,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-20 05:40:57,847 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:57,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:57,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1306896656, now seen corresponding path program 1 times [2021-10-20 05:40:57,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:57,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117076229] [2021-10-20 05:40:57,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:57,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:57,932 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:57,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117076229] [2021-10-20 05:40:57,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117076229] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:57,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:57,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-20 05:40:57,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198570285] [2021-10-20 05:40:57,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-20 05:40:57,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:57,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-20 05:40:57,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-20 05:40:57,935 INFO L87 Difference]: Start difference. First operand 569 states and 733 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-10-20 05:40:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:58,070 INFO L93 Difference]: Finished difference Result 584 states and 747 transitions. [2021-10-20 05:40:58,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-20 05:40:58,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-10-20 05:40:58,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:58,075 INFO L225 Difference]: With dead ends: 584 [2021-10-20 05:40:58,075 INFO L226 Difference]: Without dead ends: 563 [2021-10-20 05:40:58,076 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.8ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-20 05:40:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-10-20 05:40:58,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2021-10-20 05:40:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 557 states have (on average 1.2998204667863555) internal successors, (724), 562 states have internal predecessors, (724), 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-10-20 05:40:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 724 transitions. [2021-10-20 05:40:58,124 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 724 transitions. Word has length 26 [2021-10-20 05:40:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:58,124 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 724 transitions. [2021-10-20 05:40:58,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-10-20 05:40:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 724 transitions. [2021-10-20 05:40:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-20 05:40:58,127 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:58,127 INFO L512 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-10-20 05:40:58,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-20 05:40:58,127 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:58,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:58,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2107388639, now seen corresponding path program 1 times [2021-10-20 05:40:58,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:58,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116448056] [2021-10-20 05:40:58,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:58,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:58,311 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:58,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116448056] [2021-10-20 05:40:58,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116448056] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:58,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:58,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-20 05:40:58,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698179378] [2021-10-20 05:40:58,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-20 05:40:58,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:58,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-20 05:40:58,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:40:58,315 INFO L87 Difference]: Start difference. First operand 563 states and 724 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-10-20 05:40:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:58,480 INFO L93 Difference]: Finished difference Result 654 states and 835 transitions. [2021-10-20 05:40:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-20 05:40:58,481 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-10-20 05:40:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:58,485 INFO L225 Difference]: With dead ends: 654 [2021-10-20 05:40:58,485 INFO L226 Difference]: Without dead ends: 572 [2021-10-20 05:40:58,486 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-20 05:40:58,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-10-20 05:40:58,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 559. [2021-10-20 05:40:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 553 states have (on average 1.298372513562387) internal successors, (718), 558 states have internal predecessors, (718), 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-10-20 05:40:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 718 transitions. [2021-10-20 05:40:58,586 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 718 transitions. Word has length 26 [2021-10-20 05:40:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:58,586 INFO L470 AbstractCegarLoop]: Abstraction has 559 states and 718 transitions. [2021-10-20 05:40:58,587 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-10-20 05:40:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 718 transitions. [2021-10-20 05:40:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-20 05:40:58,589 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:58,590 INFO L512 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-10-20 05:40:58,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-20 05:40:58,591 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:58,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1658430507, now seen corresponding path program 1 times [2021-10-20 05:40:58,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:58,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196689594] [2021-10-20 05:40:58,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:58,593 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:58,635 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:58,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196689594] [2021-10-20 05:40:58,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196689594] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:58,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:58,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-20 05:40:58,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189818653] [2021-10-20 05:40:58,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-20 05:40:58,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:58,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-20 05:40:58,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:40:58,639 INFO L87 Difference]: Start difference. First operand 559 states and 718 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-10-20 05:40:58,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:58,852 INFO L93 Difference]: Finished difference Result 583 states and 740 transitions. [2021-10-20 05:40:58,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-20 05:40:58,853 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-10-20 05:40:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:58,857 INFO L225 Difference]: With dead ends: 583 [2021-10-20 05:40:58,857 INFO L226 Difference]: Without dead ends: 555 [2021-10-20 05:40:58,858 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-20 05:40:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-10-20 05:40:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 542. [2021-10-20 05:40:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 536 states have (on average 1.3041044776119404) internal successors, (699), 541 states have internal predecessors, (699), 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-10-20 05:40:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 699 transitions. [2021-10-20 05:40:58,919 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 699 transitions. Word has length 26 [2021-10-20 05:40:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:58,919 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 699 transitions. [2021-10-20 05:40:58,919 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-10-20 05:40:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 699 transitions. [2021-10-20 05:40:58,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-20 05:40:58,922 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:58,922 INFO L512 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-10-20 05:40:58,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-20 05:40:58,922 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:58,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:58,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1504423283, now seen corresponding path program 1 times [2021-10-20 05:40:58,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:58,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203900623] [2021-10-20 05:40:58,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:58,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:58,998 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:58,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203900623] [2021-10-20 05:40:58,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203900623] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:58,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:58,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-20 05:40:58,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166177613] [2021-10-20 05:40:58,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-20 05:40:58,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:59,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-20 05:40:59,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:40:59,001 INFO L87 Difference]: Start difference. First operand 542 states and 699 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-10-20 05:40:59,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:59,214 INFO L93 Difference]: Finished difference Result 567 states and 722 transitions. [2021-10-20 05:40:59,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-20 05:40:59,215 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-10-20 05:40:59,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:59,219 INFO L225 Difference]: With dead ends: 567 [2021-10-20 05:40:59,219 INFO L226 Difference]: Without dead ends: 547 [2021-10-20 05:40:59,220 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-20 05:40:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-10-20 05:40:59,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 534. [2021-10-20 05:40:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 528 states have (on average 1.3068181818181819) internal successors, (690), 533 states have internal predecessors, (690), 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-10-20 05:40:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 690 transitions. [2021-10-20 05:40:59,275 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 690 transitions. Word has length 27 [2021-10-20 05:40:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:59,275 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 690 transitions. [2021-10-20 05:40:59,275 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-10-20 05:40:59,276 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 690 transitions. [2021-10-20 05:40:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-20 05:40:59,277 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:59,278 INFO L512 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-10-20 05:40:59,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-20 05:40:59,278 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:59,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:59,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1155960076, now seen corresponding path program 1 times [2021-10-20 05:40:59,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:59,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599243175] [2021-10-20 05:40:59,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:59,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:59,341 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:59,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599243175] [2021-10-20 05:40:59,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599243175] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:59,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:59,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-20 05:40:59,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035421138] [2021-10-20 05:40:59,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-20 05:40:59,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:59,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-20 05:40:59,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-20 05:40:59,343 INFO L87 Difference]: Start difference. First operand 534 states and 690 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-10-20 05:40:59,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:59,464 INFO L93 Difference]: Finished difference Result 549 states and 704 transitions. [2021-10-20 05:40:59,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-20 05:40:59,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-10-20 05:40:59,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:59,469 INFO L225 Difference]: With dead ends: 549 [2021-10-20 05:40:59,469 INFO L226 Difference]: Without dead ends: 532 [2021-10-20 05:40:59,470 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-20 05:40:59,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-10-20 05:40:59,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2021-10-20 05:40:59,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 526 states have (on average 1.306083650190114) internal successors, (687), 531 states have internal predecessors, (687), 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-10-20 05:40:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 687 transitions. [2021-10-20 05:40:59,525 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 687 transitions. Word has length 27 [2021-10-20 05:40:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:59,525 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 687 transitions. [2021-10-20 05:40:59,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-10-20 05:40:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 687 transitions. [2021-10-20 05:40:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-20 05:40:59,527 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:59,528 INFO L512 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-10-20 05:40:59,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-20 05:40:59,528 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:59,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:59,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1611200436, now seen corresponding path program 1 times [2021-10-20 05:40:59,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:59,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258286579] [2021-10-20 05:40:59,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:59,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:59,570 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:59,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258286579] [2021-10-20 05:40:59,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258286579] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:59,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:59,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-20 05:40:59,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518482849] [2021-10-20 05:40:59,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-20 05:40:59,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:59,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-20 05:40:59,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-20 05:40:59,573 INFO L87 Difference]: Start difference. First operand 532 states and 687 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-10-20 05:40:59,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:40:59,779 INFO L93 Difference]: Finished difference Result 634 states and 803 transitions. [2021-10-20 05:40:59,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-20 05:40:59,779 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-10-20 05:40:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:40:59,784 INFO L225 Difference]: With dead ends: 634 [2021-10-20 05:40:59,784 INFO L226 Difference]: Without dead ends: 615 [2021-10-20 05:40:59,785 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:40:59,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-10-20 05:40:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 532. [2021-10-20 05:40:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 526 states have (on average 1.3041825095057034) internal successors, (686), 531 states have internal predecessors, (686), 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-10-20 05:40:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 686 transitions. [2021-10-20 05:40:59,842 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 686 transitions. Word has length 27 [2021-10-20 05:40:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:40:59,842 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 686 transitions. [2021-10-20 05:40:59,842 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-10-20 05:40:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 686 transitions. [2021-10-20 05:40:59,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-20 05:40:59,844 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:40:59,845 INFO L512 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-10-20 05:40:59,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-20 05:40:59,845 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:40:59,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:40:59,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1713212070, now seen corresponding path program 1 times [2021-10-20 05:40:59,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:40:59,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071311497] [2021-10-20 05:40:59,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:40:59,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:40:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:40:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:40:59,945 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:40:59,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071311497] [2021-10-20 05:40:59,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071311497] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:40:59,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:40:59,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:40:59,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338125437] [2021-10-20 05:40:59,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-20 05:40:59,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:40:59,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-20 05:40:59,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-20 05:40:59,948 INFO L87 Difference]: Start difference. First operand 532 states and 686 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-10-20 05:41:00,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:41:00,241 INFO L93 Difference]: Finished difference Result 641 states and 818 transitions. [2021-10-20 05:41:00,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-20 05:41:00,242 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-10-20 05:41:00,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:41:00,246 INFO L225 Difference]: With dead ends: 641 [2021-10-20 05:41:00,246 INFO L226 Difference]: Without dead ends: 532 [2021-10-20 05:41:00,248 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:41:00,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-10-20 05:41:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2021-10-20 05:41:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 526 states have (on average 1.296577946768061) internal successors, (682), 531 states have internal predecessors, (682), 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-10-20 05:41:00,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 682 transitions. [2021-10-20 05:41:00,307 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 682 transitions. Word has length 27 [2021-10-20 05:41:00,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:41:00,308 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 682 transitions. [2021-10-20 05:41:00,308 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-10-20 05:41:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 682 transitions. [2021-10-20 05:41:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-20 05:41:00,310 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:41:00,310 INFO L512 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-10-20 05:41:00,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-20 05:41:00,311 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:41:00,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:41:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1843803493, now seen corresponding path program 1 times [2021-10-20 05:41:00,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:41:00,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89922171] [2021-10-20 05:41:00,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:41:00,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:41:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:41:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:41:00,367 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:41:00,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89922171] [2021-10-20 05:41:00,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89922171] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:41:00,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:41:00,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-20 05:41:00,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386151137] [2021-10-20 05:41:00,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-20 05:41:00,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:41:00,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-20 05:41:00,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:41:00,369 INFO L87 Difference]: Start difference. First operand 532 states and 682 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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-10-20 05:41:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:41:00,508 INFO L93 Difference]: Finished difference Result 616 states and 769 transitions. [2021-10-20 05:41:00,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-20 05:41:00,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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-10-20 05:41:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:41:00,513 INFO L225 Difference]: With dead ends: 616 [2021-10-20 05:41:00,513 INFO L226 Difference]: Without dead ends: 599 [2021-10-20 05:41:00,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-20 05:41:00,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-10-20 05:41:00,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 542. [2021-10-20 05:41:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 536 states have (on average 1.296641791044776) internal successors, (695), 541 states have internal predecessors, (695), 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-10-20 05:41:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 695 transitions. [2021-10-20 05:41:00,573 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 695 transitions. Word has length 28 [2021-10-20 05:41:00,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:41:00,574 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 695 transitions. [2021-10-20 05:41:00,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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-10-20 05:41:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 695 transitions. [2021-10-20 05:41:00,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-20 05:41:00,576 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:41:00,576 INFO L512 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-10-20 05:41:00,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-20 05:41:00,577 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:41:00,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:41:00,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1622268006, now seen corresponding path program 1 times [2021-10-20 05:41:00,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:41:00,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735795632] [2021-10-20 05:41:00,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:41:00,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:41:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:41:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:41:00,636 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:41:00,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735795632] [2021-10-20 05:41:00,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735795632] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:41:00,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:41:00,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-20 05:41:00,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138260205] [2021-10-20 05:41:00,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-20 05:41:00,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:41:00,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-20 05:41:00,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-20 05:41:00,639 INFO L87 Difference]: Start difference. First operand 542 states and 695 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-10-20 05:41:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:41:00,819 INFO L93 Difference]: Finished difference Result 557 states and 709 transitions. [2021-10-20 05:41:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-20 05:41:00,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-10-20 05:41:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:41:00,824 INFO L225 Difference]: With dead ends: 557 [2021-10-20 05:41:00,824 INFO L226 Difference]: Without dead ends: 536 [2021-10-20 05:41:00,826 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-20 05:41:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-10-20 05:41:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2021-10-20 05:41:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 530 states have (on average 1.2943396226415094) internal successors, (686), 535 states have internal predecessors, (686), 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-10-20 05:41:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 686 transitions. [2021-10-20 05:41:00,890 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 686 transitions. Word has length 28 [2021-10-20 05:41:00,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:41:00,891 INFO L470 AbstractCegarLoop]: Abstraction has 536 states and 686 transitions. [2021-10-20 05:41:00,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-10-20 05:41:00,891 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 686 transitions. [2021-10-20 05:41:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-20 05:41:00,893 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:41:00,893 INFO L512 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-10-20 05:41:00,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-20 05:41:00,894 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:41:00,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:41:00,894 INFO L82 PathProgramCache]: Analyzing trace with hash -453382508, now seen corresponding path program 1 times [2021-10-20 05:41:00,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:41:00,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102241375] [2021-10-20 05:41:00,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:41:00,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:41:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:41:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:41:01,008 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:41:01,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102241375] [2021-10-20 05:41:01,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102241375] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:41:01,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:41:01,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-20 05:41:01,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226833824] [2021-10-20 05:41:01,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-20 05:41:01,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:41:01,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-20 05:41:01,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-20 05:41:01,010 INFO L87 Difference]: Start difference. First operand 536 states and 686 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-10-20 05:41:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:41:01,265 INFO L93 Difference]: Finished difference Result 561 states and 709 transitions. [2021-10-20 05:41:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-20 05:41:01,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-10-20 05:41:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:41:01,285 INFO L225 Difference]: With dead ends: 561 [2021-10-20 05:41:01,292 INFO L226 Difference]: Without dead ends: 540 [2021-10-20 05:41:01,293 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 80.7ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-20 05:41:01,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-10-20 05:41:01,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 527. [2021-10-20 05:41:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 521 states have (on average 1.2975047984644914) internal successors, (676), 526 states have internal predecessors, (676), 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-10-20 05:41:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 676 transitions. [2021-10-20 05:41:01,355 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 676 transitions. Word has length 28 [2021-10-20 05:41:01,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:41:01,355 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 676 transitions. [2021-10-20 05:41:01,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-10-20 05:41:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 676 transitions. [2021-10-20 05:41:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-20 05:41:01,358 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:41:01,358 INFO L512 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-10-20 05:41:01,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-20 05:41:01,359 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:41:01,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:41:01,360 INFO L82 PathProgramCache]: Analyzing trace with hash 695346116, now seen corresponding path program 1 times [2021-10-20 05:41:01,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:41:01,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491227257] [2021-10-20 05:41:01,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:41:01,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:41:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:41:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:41:01,410 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:41:01,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491227257] [2021-10-20 05:41:01,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491227257] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:41:01,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:41:01,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-20 05:41:01,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713256564] [2021-10-20 05:41:01,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-20 05:41:01,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:41:01,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-20 05:41:01,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-20 05:41:01,413 INFO L87 Difference]: Start difference. First operand 527 states and 676 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-10-20 05:41:01,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:41:01,738 INFO L93 Difference]: Finished difference Result 565 states and 716 transitions. [2021-10-20 05:41:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-20 05:41:01,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-10-20 05:41:01,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:41:01,743 INFO L225 Difference]: With dead ends: 565 [2021-10-20 05:41:01,743 INFO L226 Difference]: Without dead ends: 561 [2021-10-20 05:41:01,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-20 05:41:01,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2021-10-20 05:41:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 500. [2021-10-20 05:41:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 496 states have (on average 1.2903225806451613) internal successors, (640), 499 states have internal predecessors, (640), 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-10-20 05:41:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 640 transitions. [2021-10-20 05:41:01,812 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 640 transitions. Word has length 28 [2021-10-20 05:41:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:41:01,812 INFO L470 AbstractCegarLoop]: Abstraction has 500 states and 640 transitions. [2021-10-20 05:41:01,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-10-20 05:41:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 640 transitions. [2021-10-20 05:41:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-20 05:41:01,815 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:41:01,815 INFO L512 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] [2021-10-20 05:41:01,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-20 05:41:01,816 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:41:01,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:41:01,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1529539768, now seen corresponding path program 1 times [2021-10-20 05:41:01,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:41:01,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006616304] [2021-10-20 05:41:01,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:41:01,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:41:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:41:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:41:01,896 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:41:01,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006616304] [2021-10-20 05:41:01,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006616304] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:41:01,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:41:01,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-20 05:41:01,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31217633] [2021-10-20 05:41:01,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-20 05:41:01,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:41:01,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-20 05:41:01,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-20 05:41:01,900 INFO L87 Difference]: Start difference. First operand 500 states and 640 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-10-20 05:41:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:41:02,353 INFO L93 Difference]: Finished difference Result 631 states and 789 transitions. [2021-10-20 05:41:02,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-20 05:41:02,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 29 [2021-10-20 05:41:02,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:41:02,357 INFO L225 Difference]: With dead ends: 631 [2021-10-20 05:41:02,358 INFO L226 Difference]: Without dead ends: 565 [2021-10-20 05:41:02,359 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.5ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-20 05:41:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-10-20 05:41:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 503. [2021-10-20 05:41:02,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 499 states have (on average 1.2745490981963927) internal successors, (636), 502 states have internal predecessors, (636), 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-10-20 05:41:02,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 636 transitions. [2021-10-20 05:41:02,414 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 636 transitions. Word has length 29 [2021-10-20 05:41:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:41:02,414 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 636 transitions. [2021-10-20 05:41:02,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-10-20 05:41:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 636 transitions. [2021-10-20 05:41:02,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-20 05:41:02,417 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:41:02,417 INFO L512 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] [2021-10-20 05:41:02,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-20 05:41:02,418 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:41:02,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:41:02,419 INFO L82 PathProgramCache]: Analyzing trace with hash -120439325, now seen corresponding path program 1 times [2021-10-20 05:41:02,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:41:02,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678951541] [2021-10-20 05:41:02,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:41:02,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:41:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:41:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:41:02,476 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:41:02,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678951541] [2021-10-20 05:41:02,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678951541] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:41:02,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:41:02,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-20 05:41:02,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808888591] [2021-10-20 05:41:02,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-20 05:41:02,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:41:02,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-20 05:41:02,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-20 05:41:02,479 INFO L87 Difference]: Start difference. First operand 503 states and 636 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-10-20 05:41:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:41:02,645 INFO L93 Difference]: Finished difference Result 522 states and 654 transitions. [2021-10-20 05:41:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-20 05:41:02,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 29 [2021-10-20 05:41:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:41:02,650 INFO L225 Difference]: With dead ends: 522 [2021-10-20 05:41:02,650 INFO L226 Difference]: Without dead ends: 496 [2021-10-20 05:41:02,650 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.6ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-20 05:41:02,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-10-20 05:41:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2021-10-20 05:41:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 492 states have (on average 1.2682926829268293) internal successors, (624), 495 states have internal predecessors, (624), 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-10-20 05:41:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 624 transitions. [2021-10-20 05:41:02,705 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 624 transitions. Word has length 29 [2021-10-20 05:41:02,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:41:02,706 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 624 transitions. [2021-10-20 05:41:02,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-10-20 05:41:02,706 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 624 transitions. [2021-10-20 05:41:02,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-20 05:41:02,708 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:41:02,708 INFO L512 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] [2021-10-20 05:41:02,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-20 05:41:02,709 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:41:02,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:41:02,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1964448463, now seen corresponding path program 1 times [2021-10-20 05:41:02,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:41:02,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786159950] [2021-10-20 05:41:02,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:41:02,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:41:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:41:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:41:02,738 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:41:02,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786159950] [2021-10-20 05:41:02,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786159950] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:41:02,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:41:02,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:41:02,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250888519] [2021-10-20 05:41:02,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-20 05:41:02,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:41:02,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-20 05:41:02,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:41:02,742 INFO L87 Difference]: Start difference. First operand 496 states and 624 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10-20 05:41:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:41:02,817 INFO L93 Difference]: Finished difference Result 534 states and 659 transitions. [2021-10-20 05:41:02,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-20 05:41:02,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2021-10-20 05:41:02,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:41:02,821 INFO L225 Difference]: With dead ends: 534 [2021-10-20 05:41:02,822 INFO L226 Difference]: Without dead ends: 514 [2021-10-20 05:41:02,822 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:41:02,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-10-20 05:41:02,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 496. [2021-10-20 05:41:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 492 states have (on average 1.266260162601626) internal successors, (623), 495 states have internal predecessors, (623), 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-10-20 05:41:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 623 transitions. [2021-10-20 05:41:02,881 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 623 transitions. Word has length 29 [2021-10-20 05:41:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:41:02,881 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 623 transitions. [2021-10-20 05:41:02,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10-20 05:41:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 623 transitions. [2021-10-20 05:41:02,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-20 05:41:02,884 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:41:02,884 INFO L512 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] [2021-10-20 05:41:02,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-20 05:41:02,884 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:41:02,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:41:02,885 INFO L82 PathProgramCache]: Analyzing trace with hash 644489272, now seen corresponding path program 1 times [2021-10-20 05:41:02,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:41:02,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90004046] [2021-10-20 05:41:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:41:02,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:41:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:41:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:41:02,970 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:41:02,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90004046] [2021-10-20 05:41:02,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90004046] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:41:02,971 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:41:02,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-20 05:41:02,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657121853] [2021-10-20 05:41:02,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-20 05:41:02,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:41:02,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-20 05:41:02,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-20 05:41:02,974 INFO L87 Difference]: Start difference. First operand 496 states and 623 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-10-20 05:41:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:41:03,190 INFO L93 Difference]: Finished difference Result 526 states and 650 transitions. [2021-10-20 05:41:03,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-20 05:41:03,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 29 [2021-10-20 05:41:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:41:03,194 INFO L225 Difference]: With dead ends: 526 [2021-10-20 05:41:03,195 INFO L226 Difference]: Without dead ends: 505 [2021-10-20 05:41:03,195 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.6ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-20 05:41:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-20 05:41:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 484. [2021-10-20 05:41:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 480 states have (on average 1.2625) internal successors, (606), 483 states have internal predecessors, (606), 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-10-20 05:41:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 606 transitions. [2021-10-20 05:41:03,251 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 606 transitions. Word has length 29 [2021-10-20 05:41:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:41:03,252 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 606 transitions. [2021-10-20 05:41:03,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-10-20 05:41:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 606 transitions. [2021-10-20 05:41:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-20 05:41:03,254 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:41:03,254 INFO L512 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] [2021-10-20 05:41:03,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-20 05:41:03,255 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:41:03,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:41:03,255 INFO L82 PathProgramCache]: Analyzing trace with hash 692479088, now seen corresponding path program 1 times [2021-10-20 05:41:03,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:41:03,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172532216] [2021-10-20 05:41:03,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:41:03,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:41:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:41:03,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:41:03,282 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:41:03,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172532216] [2021-10-20 05:41:03,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172532216] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:41:03,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:41:03,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:41:03,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252767736] [2021-10-20 05:41:03,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-20 05:41:03,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:41:03,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-20 05:41:03,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:41:03,285 INFO L87 Difference]: Start difference. First operand 484 states and 606 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10-20 05:41:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:41:03,428 INFO L93 Difference]: Finished difference Result 555 states and 686 transitions. [2021-10-20 05:41:03,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-20 05:41:03,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2021-10-20 05:41:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:41:03,431 INFO L225 Difference]: With dead ends: 555 [2021-10-20 05:41:03,431 INFO L226 Difference]: Without dead ends: 328 [2021-10-20 05:41:03,432 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:41:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-10-20 05:41:03,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 306. [2021-10-20 05:41:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 302 states have (on average 1.2086092715231789) internal successors, (365), 305 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-10-20 05:41:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 365 transitions. [2021-10-20 05:41:03,472 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 365 transitions. Word has length 29 [2021-10-20 05:41:03,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:41:03,472 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 365 transitions. [2021-10-20 05:41:03,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10-20 05:41:03,473 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 365 transitions. [2021-10-20 05:41:03,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-20 05:41:03,474 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:41:03,474 INFO L512 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] [2021-10-20 05:41:03,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-20 05:41:03,475 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:41:03,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:41:03,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1090089878, now seen corresponding path program 1 times [2021-10-20 05:41:03,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:41:03,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326805895] [2021-10-20 05:41:03,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:41:03,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:41:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:41:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:41:03,588 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:41:03,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326805895] [2021-10-20 05:41:03,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326805895] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:41:03,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:41:03,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-20 05:41:03,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716815834] [2021-10-20 05:41:03,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-20 05:41:03,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:41:03,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-20 05:41:03,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-20 05:41:03,591 INFO L87 Difference]: Start difference. First operand 306 states and 365 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-10-20 05:41:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:41:03,837 INFO L93 Difference]: Finished difference Result 362 states and 423 transitions. [2021-10-20 05:41:03,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-20 05:41:03,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2021-10-20 05:41:03,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:41:03,842 INFO L225 Difference]: With dead ends: 362 [2021-10-20 05:41:03,843 INFO L226 Difference]: Without dead ends: 270 [2021-10-20 05:41:03,843 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 85.9ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-20 05:41:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-20 05:41:03,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 248. [2021-10-20 05:41:03,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 244 states have (on average 1.1762295081967213) internal successors, (287), 247 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-10-20 05:41:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 287 transitions. [2021-10-20 05:41:03,880 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 287 transitions. Word has length 29 [2021-10-20 05:41:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:41:03,881 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 287 transitions. [2021-10-20 05:41:03,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-10-20 05:41:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 287 transitions. [2021-10-20 05:41:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-20 05:41:03,882 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:41:03,883 INFO L512 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] [2021-10-20 05:41:03,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-20 05:41:03,883 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:41:03,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:41:03,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1241673930, now seen corresponding path program 1 times [2021-10-20 05:41:03,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:41:03,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671408993] [2021-10-20 05:41:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:41:03,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:41:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:41:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:41:03,912 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:41:03,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671408993] [2021-10-20 05:41:03,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671408993] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:41:03,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:41:03,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:41:03,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793347742] [2021-10-20 05:41:03,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-20 05:41:03,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:41:03,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-20 05:41:03,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:41:03,916 INFO L87 Difference]: Start difference. First operand 248 states and 287 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-10-20 05:41:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:41:03,968 INFO L93 Difference]: Finished difference Result 289 states and 328 transitions. [2021-10-20 05:41:03,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-20 05:41:03,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2021-10-20 05:41:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:41:03,971 INFO L225 Difference]: With dead ends: 289 [2021-10-20 05:41:03,971 INFO L226 Difference]: Without dead ends: 253 [2021-10-20 05:41:03,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:41:03,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-10-20 05:41:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2021-10-20 05:41:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 244 states have (on average 1.1721311475409837) internal successors, (286), 247 states have internal predecessors, (286), 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-10-20 05:41:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 286 transitions. [2021-10-20 05:41:04,009 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 286 transitions. Word has length 32 [2021-10-20 05:41:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:41:04,010 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 286 transitions. [2021-10-20 05:41:04,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-10-20 05:41:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions. [2021-10-20 05:41:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-20 05:41:04,011 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:41:04,011 INFO L512 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] [2021-10-20 05:41:04,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-20 05:41:04,012 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:41:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:41:04,013 INFO L82 PathProgramCache]: Analyzing trace with hash 156718672, now seen corresponding path program 1 times [2021-10-20 05:41:04,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:41:04,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553693545] [2021-10-20 05:41:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:41:04,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:41:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:41:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:41:04,081 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:41:04,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553693545] [2021-10-20 05:41:04,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553693545] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:41:04,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:41:04,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:41:04,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302049222] [2021-10-20 05:41:04,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-20 05:41:04,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:41:04,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-20 05:41:04,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-20 05:41:04,084 INFO L87 Difference]: Start difference. First operand 248 states and 286 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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-10-20 05:41:04,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:41:04,217 INFO L93 Difference]: Finished difference Result 257 states and 294 transitions. [2021-10-20 05:41:04,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-20 05:41:04,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2021-10-20 05:41:04,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:41:04,220 INFO L225 Difference]: With dead ends: 257 [2021-10-20 05:41:04,220 INFO L226 Difference]: Without dead ends: 240 [2021-10-20 05:41:04,220 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:41:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-10-20 05:41:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2021-10-20 05:41:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 232 states have (on average 1.1724137931034482) internal successors, (272), 235 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-10-20 05:41:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 272 transitions. [2021-10-20 05:41:04,255 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 272 transitions. Word has length 34 [2021-10-20 05:41:04,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:41:04,255 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 272 transitions. [2021-10-20 05:41:04,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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-10-20 05:41:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 272 transitions. [2021-10-20 05:41:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-20 05:41:04,257 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:41:04,257 INFO L512 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] [2021-10-20 05:41:04,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-20 05:41:04,258 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:41:04,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:41:04,258 INFO L82 PathProgramCache]: Analyzing trace with hash -856105982, now seen corresponding path program 1 times [2021-10-20 05:41:04,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:41:04,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732858704] [2021-10-20 05:41:04,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:41:04,260 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:41:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:41:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:41:04,396 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:41:04,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732858704] [2021-10-20 05:41:04,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732858704] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:41:04,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:41:04,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-20 05:41:04,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180228005] [2021-10-20 05:41:04,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-20 05:41:04,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:41:04,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-20 05:41:04,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-20 05:41:04,401 INFO L87 Difference]: Start difference. First operand 236 states and 272 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-10-20 05:41:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:41:04,565 INFO L93 Difference]: Finished difference Result 259 states and 292 transitions. [2021-10-20 05:41:04,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-20 05:41:04,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2021-10-20 05:41:04,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:41:04,568 INFO L225 Difference]: With dead ends: 259 [2021-10-20 05:41:04,568 INFO L226 Difference]: Without dead ends: 212 [2021-10-20 05:41:04,569 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 101.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-20 05:41:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-10-20 05:41:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 198. [2021-10-20 05:41:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 195 states have (on average 1.158974358974359) internal successors, (226), 197 states have internal predecessors, (226), 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-10-20 05:41:04,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 226 transitions. [2021-10-20 05:41:04,604 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 226 transitions. Word has length 34 [2021-10-20 05:41:04,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:41:04,606 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 226 transitions. [2021-10-20 05:41:04,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-10-20 05:41:04,607 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 226 transitions. [2021-10-20 05:41:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-20 05:41:04,608 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:41:04,608 INFO L512 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] [2021-10-20 05:41:04,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-20 05:41:04,610 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:41:04,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:41:04,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1806263113, now seen corresponding path program 1 times [2021-10-20 05:41:04,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:41:04,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558552465] [2021-10-20 05:41:04,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:41:04,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:41:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-20 05:41:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-20 05:41:04,641 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-20 05:41:04,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558552465] [2021-10-20 05:41:04,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558552465] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-20 05:41:04,641 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-20 05:41:04,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-20 05:41:04,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9179389] [2021-10-20 05:41:04,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-20 05:41:04,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-20 05:41:04,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-20 05:41:04,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:41:04,643 INFO L87 Difference]: Start difference. First operand 198 states and 226 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-10-20 05:41:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-20 05:41:04,690 INFO L93 Difference]: Finished difference Result 208 states and 236 transitions. [2021-10-20 05:41:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-20 05:41:04,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2021-10-20 05:41:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-20 05:41:04,693 INFO L225 Difference]: With dead ends: 208 [2021-10-20 05:41:04,693 INFO L226 Difference]: Without dead ends: 198 [2021-10-20 05:41:04,694 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-20 05:41:04,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-20 05:41:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-10-20 05:41:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 195 states have (on average 1.1487179487179486) internal successors, (224), 197 states have internal predecessors, (224), 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-10-20 05:41:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 224 transitions. [2021-10-20 05:41:04,730 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 224 transitions. Word has length 34 [2021-10-20 05:41:04,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-20 05:41:04,730 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 224 transitions. [2021-10-20 05:41:04,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-10-20 05:41:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 224 transitions. [2021-10-20 05:41:04,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-20 05:41:04,732 INFO L504 BasicCegarLoop]: Found error trace [2021-10-20 05:41:04,732 INFO L512 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-10-20 05:41:04,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-20 05:41:04,733 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-20 05:41:04,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-20 05:41:04,733 INFO L82 PathProgramCache]: Analyzing trace with hash -829704437, now seen corresponding path program 1 times [2021-10-20 05:41:04,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-20 05:41:04,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487542020] [2021-10-20 05:41:04,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-20 05:41:04,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-20 05:41:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-20 05:41:04,777 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-20 05:41:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-20 05:41:04,870 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-20 05:41:04,870 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-20 05:41:04,872 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,874 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,875 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,875 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,875 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,875 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,876 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,876 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,876 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,876 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,877 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,877 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,877 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,877 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,878 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,878 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,878 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,878 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,879 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,879 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,879 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,879 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,880 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,880 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,880 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,881 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,881 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,881 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,881 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,882 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,882 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,882 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,882 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,883 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,883 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,883 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,883 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,884 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,884 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,884 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,884 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,885 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,885 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,885 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,885 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,886 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,886 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,886 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,886 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,887 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,887 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,887 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,887 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,888 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,888 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,888 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,888 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,895 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,895 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,895 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,895 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION [2021-10-20 05:41:04,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-20 05:41:04,910 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-20 05:41:05,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 05:41:05 BoogieIcfgContainer [2021-10-20 05:41:05,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-20 05:41:05,132 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-20 05:41:05,132 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-20 05:41:05,134 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-20 05:41:05,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:40:47" (3/4) ... [2021-10-20 05:41:05,140 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-20 05:41:05,297 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/witness.graphml [2021-10-20 05:41:05,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-20 05:41:05,299 INFO L168 Benchmark]: Toolchain (without parser) took 25572.68 ms. Allocated memory was 83.9 MB in the beginning and 513.8 MB in the end (delta: 429.9 MB). Free memory was 44.8 MB in the beginning and 187.2 MB in the end (delta: -142.3 MB). Peak memory consumption was 285.9 MB. Max. memory is 16.1 GB. [2021-10-20 05:41:05,300 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 83.9 MB. Free memory was 63.3 MB in the beginning and 63.2 MB in the end (delta: 68.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-20 05:41:05,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 925.59 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 44.6 MB in the beginning and 58.7 MB in the end (delta: -14.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-20 05:41:05,301 INFO L168 Benchmark]: Boogie Procedure Inliner took 286.96 ms. Allocated memory is still 100.7 MB. Free memory was 58.7 MB in the beginning and 38.5 MB in the end (delta: 20.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-20 05:41:05,301 INFO L168 Benchmark]: Boogie Preprocessor took 288.02 ms. Allocated memory is still 100.7 MB. Free memory was 38.5 MB in the beginning and 63.8 MB in the end (delta: -25.3 MB). Peak memory consumption was 27.1 MB. Max. memory is 16.1 GB. [2021-10-20 05:41:05,302 INFO L168 Benchmark]: RCFGBuilder took 6388.25 ms. Allocated memory was 100.7 MB in the beginning and 216.0 MB in the end (delta: 115.3 MB). Free memory was 63.8 MB in the beginning and 74.8 MB in the end (delta: -11.0 MB). Peak memory consumption was 105.3 MB. Max. memory is 16.1 GB. [2021-10-20 05:41:05,302 INFO L168 Benchmark]: TraceAbstraction took 17508.04 ms. Allocated memory was 216.0 MB in the beginning and 513.8 MB in the end (delta: 297.8 MB). Free memory was 73.8 MB in the beginning and 198.8 MB in the end (delta: -125.0 MB). Peak memory consumption was 173.9 MB. Max. memory is 16.1 GB. [2021-10-20 05:41:05,303 INFO L168 Benchmark]: Witness Printer took 165.47 ms. Allocated memory is still 513.8 MB. Free memory was 198.8 MB in the beginning and 187.2 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-20 05:41:05,306 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.32 ms. Allocated memory is still 83.9 MB. Free memory was 63.3 MB in the beginning and 63.2 MB in the end (delta: 68.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 925.59 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 44.6 MB in the beginning and 58.7 MB in the end (delta: -14.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 286.96 ms. Allocated memory is still 100.7 MB. Free memory was 58.7 MB in the beginning and 38.5 MB in the end (delta: 20.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 288.02 ms. Allocated memory is still 100.7 MB. Free memory was 38.5 MB in the beginning and 63.8 MB in the end (delta: -25.3 MB). Peak memory consumption was 27.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 6388.25 ms. Allocated memory was 100.7 MB in the beginning and 216.0 MB in the end (delta: 115.3 MB). Free memory was 63.8 MB in the beginning and 74.8 MB in the end (delta: -11.0 MB). Peak memory consumption was 105.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17508.04 ms. Allocated memory was 216.0 MB in the beginning and 513.8 MB in the end (delta: 297.8 MB). Free memory was 73.8 MB in the beginning and 198.8 MB in the end (delta: -125.0 MB). Peak memory consumption was 173.9 MB. Max. memory is 16.1 GB. * Witness Printer took 165.47 ms. Allocated memory is still 513.8 MB. Free memory was 198.8 MB in the beginning and 187.2 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 59]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int s ; [L33] int UNLOADED ; [L34] int NP ; [L35] int DC ; [L36] int SKIP1 ; [L37] int SKIP2 ; [L38] int MPR1 ; [L39] int MPR3 ; [L40] int IPC ; [L41] int pended ; [L42] int compFptr ; [L43] int compRegistered ; [L44] int lowerDriverReturn ; [L45] int setEventCalled ; [L46] int customIrp ; [L47] int routine ; [L48] int myStatus ; [L49] int pirp ; [L50] int Executive ; [L51] int Suspended ; [L52] int KernelMode ; [L53] int DeviceUsageTypePaging ; [L1718] int pirp__IoStatus__Status ; [L1719] int d = __VERIFIER_nondet_int() ; [L1720] int status = __VERIFIER_nondet_int() ; [L1721] int irp = __VERIFIER_nondet_int() ; [L1722] int we_should_unload = __VERIFIER_nondet_int() ; [L1723] int irp_choice = __VERIFIER_nondet_int() ; [L1724] int devobj = __VERIFIER_nondet_int() ; [L1725] int __cil_tmp9 ; [L1730] s = 0 [L1731] UNLOADED = 0 [L1732] NP = 0 [L1733] DC = 0 [L1734] SKIP1 = 0 [L1735] SKIP2 = 0 [L1736] MPR1 = 0 [L1737] MPR3 = 0 [L1738] IPC = 0 [L1739] pended = 0 [L1740] compFptr = 0 [L1741] compRegistered = 0 [L1742] lowerDriverReturn = 0 [L1743] setEventCalled = 0 [L1744] customIrp = 0 [L1745] routine = 0 [L1746] myStatus = 0 [L1747] pirp = 0 [L1748] Executive = 0 [L1749] Suspended = 5 [L1750] KernelMode = 0 [L1751] DeviceUsageTypePaging = 1 [L1754] pirp = irp [L67] UNLOADED = 0 [L68] NP = 1 [L69] DC = 2 [L70] SKIP1 = 3 [L71] SKIP2 = 4 [L72] MPR1 = 5 [L73] MPR3 = 6 [L74] IPC = 7 [L75] s = UNLOADED [L76] pended = 0 [L77] compFptr = 0 [L78] compRegistered = 0 [L79] lowerDriverReturn = 0 [L80] setEventCalled = 0 [L81] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1757] COND TRUE status >= 0 [L1758] s = NP [L1759] customIrp = 0 [L1760] setEventCalled = customIrp [L1761] lowerDriverReturn = setEventCalled [L1762] compRegistered = lowerDriverReturn [L1763] compFptr = compRegistered [L1764] pended = compFptr [L1765] pirp__IoStatus__Status = 0 [L1766] myStatus = 0 [L1767] COND TRUE irp_choice == 0 [L1768] pirp__IoStatus__Status = -1073741637 [L1769] myStatus = -1073741637 [L1707] s = NP [L1708] customIrp = 0 [L1709] setEventCalled = customIrp [L1710] lowerDriverReturn = setEventCalled [L1711] compRegistered = lowerDriverReturn [L1712] compFptr = compRegistered [L1713] pended = compFptr VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1775] COND FALSE !(status < 0) [L1779] int tmp_ndt_1; [L1780] tmp_ndt_1 = __VERIFIER_nondet_int() [L1781] COND TRUE tmp_ndt_1 == 2 [L313] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L314] int status ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L317] COND FALSE !(deviceExtension__Active == 2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L320] COND FALSE !(deviceExtension__Active == 3) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L323] COND FALSE !(deviceExtension__Active == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L326] COND TRUE deviceExtension__Active == 7 [L1591] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1592] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1593] int irpSp__Control ; [L1594] int tmp ; [L1595] int tmp___0 ; [L1596] int __cil_tmp8 ; [L1597] int __cil_tmp9 ; [L1598] int __cil_tmp10 ; [L1599] int __cil_tmp11 ; [L1600] int __cil_tmp12 ; [L1604] __cil_tmp8 = 56 [L1605] __cil_tmp9 = 16384 [L1606] __cil_tmp10 = 131072 [L1607] __cil_tmp11 = 147456 [L1608] __cil_tmp12 = 147512 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1610] COND FALSE !(s != NP) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1615] COND FALSE !(compRegistered != 0) [L1620] compRegistered = 1 [L1621] routine = 0 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] irpSp__Control = 224 [L1900] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1901] int returnVal2 ; [L1902] int compRetStatus ; [L1903] int lcontext = __VERIFIER_nondet_int() ; [L1904] unsigned long __cil_tmp8 ; VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE \read(compRegistered) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1908] COND TRUE routine == 0 [L1569] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1570] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1573] COND TRUE \read(Irp__PendingReturned) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1574] COND TRUE pended == 0 [L1575] pended = 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1582] COND FALSE !(myStatus >= 0) [L1587] return (myStatus); [L1910] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1920] __cil_tmp8 = (unsigned long )compRetStatus VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1921] COND FALSE !(__cil_tmp8 == -1073741802) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1928] COND FALSE !(\read(Irp__PendingReturned)) [L1931] int tmp_ndt_4; [L1932] tmp_ndt_4 = __VERIFIER_nondet_int() [L1933] COND TRUE tmp_ndt_4 == 0 [L1944] returnVal2 = 0 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1958] COND TRUE s == NP [L1959] s = IPC [L1960] lowerDriverReturn = returnVal2 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1981] return (returnVal2); [L1626] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1628] return (tmp); VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L363] return (status); [L1798] status = CdAudioDeviceControl(devobj, pirp) [L1819] COND FALSE !(\read(we_should_unload)) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1825] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1826] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1833] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1834] COND FALSE !(s == MPR3) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1841] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1842] COND TRUE status != -1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1843] COND TRUE s != SKIP2 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1844] COND FALSE !(s != IPC) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1857] COND FALSE !(pended != 1) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1869] COND TRUE status != 259 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L59] reach_error() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - UnprovableResult [Line: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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, 779 locations, 103 error locations. Started 1 CEGAR loops. OverallTime: 17154.4ms, OverallIterations: 45, TraceHistogramMax: 1, EmptinessCheckTime: 116.8ms, AutomataDifference: 10936.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 38.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 25841 SDtfs, 12280 SDslu, 43843 SDs, 0 SdLazy, 5346 SolverSat, 764 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5353.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 964.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=779occurred in iteration=0, InterpolantAutomatonStates: 192, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2286.0ms AutomataMinimizationTime, 44 MinimizatonAttempts, 1017 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 146.2ms SsaConstructionTime, 731.0ms SatisfiabilityAnalysisTime, 2071.0ms InterpolantComputationTime, 1080 NumberOfCodeBlocks, 1080 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1000 ConstructedInterpolants, 0 QuantifiedInterpolants, 2967 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 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-10-20 05:41:05,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd53f6d-2565-4e20-91f5-1326bb2d296d/bin/utaipan-tZwUujhuQw/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...