./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 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/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_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:50:02,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:50:02,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:50:02,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:50:02,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:50:02,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:50:02,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:50:02,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:50:02,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:50:02,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:50:02,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:50:02,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:50:02,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:50:02,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:50:02,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:50:02,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:50:02,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:50:02,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:50:02,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:50:02,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:50:02,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:50:02,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:50:02,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:50:02,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:50:02,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:50:02,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:50:02,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:50:02,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:50:02,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:50:02,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:50:02,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:50:02,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:50:02,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:50:02,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:50:02,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:50:02,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:50:02,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:50:02,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:50:02,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:50:02,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:50:02,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:50:02,443 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:50:02,480 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:50:02,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:50:02,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:50:02,482 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:50:02,482 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:50:02,482 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:50:02,482 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:50:02,483 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:50:02,483 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:50:02,483 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:50:02,483 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:50:02,484 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:50:02,484 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:50:02,484 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:50:02,484 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:50:02,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:50:02,486 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:50:02,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:50:02,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:50:02,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:50:02,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:50:02,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:50:02,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:50:02,487 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:50:02,487 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:50:02,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:50:02,488 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:50:02,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:50:02,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:50:02,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:50:02,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:50:02,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:50:02,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:50:02,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:50:02,490 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:50:02,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:50:02,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:50:02,495 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:50:02,496 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:50:02,496 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_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 [2021-11-07 01:50:02,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:50:02,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:50:02,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:50:02,893 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:50:02,900 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:50:02,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-11-07 01:50:03,031 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/data/b0e214cd5/e3b1733790be450f8fdd99b79e8e2c19/FLAG549a5d849 [2021-11-07 01:50:03,814 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:50:03,821 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-11-07 01:50:03,864 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/data/b0e214cd5/e3b1733790be450f8fdd99b79e8e2c19/FLAG549a5d849 [2021-11-07 01:50:03,963 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/data/b0e214cd5/e3b1733790be450f8fdd99b79e8e2c19 [2021-11-07 01:50:03,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:50:03,971 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:50:03,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:50:03,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:50:03,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:50:03,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:50:03" (1/1) ... [2021-11-07 01:50:03,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36888a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:50:03, skipping insertion in model container [2021-11-07 01:50:03,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:50:03" (1/1) ... [2021-11-07 01:50:03,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:50:04,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:50:04,355 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_7794a121-6a8c-4287-aaca-a5136724d250/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-11-07 01:50:04,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:50:04,618 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:50:04,651 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_7794a121-6a8c-4287-aaca-a5136724d250/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-11-07 01:50:04,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:50:04,825 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:50:04,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:50:04 WrapperNode [2021-11-07 01:50:04,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:50:04,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:50:04,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:50:04,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:50:04,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:50:04" (1/1) ... [2021-11-07 01:50:04,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:50:04" (1/1) ... [2021-11-07 01:50:05,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:50:05,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:50:05,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:50:05,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:50:05,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:50:04" (1/1) ... [2021-11-07 01:50:05,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:50:04" (1/1) ... [2021-11-07 01:50:05,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:50:04" (1/1) ... [2021-11-07 01:50:05,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:50:04" (1/1) ... [2021-11-07 01:50:05,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:50:04" (1/1) ... [2021-11-07 01:50:05,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:50:04" (1/1) ... [2021-11-07 01:50:05,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:50:04" (1/1) ... [2021-11-07 01:50:05,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:50:05,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:50:05,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:50:05,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:50:05,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:50:04" (1/1) ... [2021-11-07 01:50:05,248 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:50:05,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:50:05,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:50:05,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:50:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:50:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:50:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:50:05,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:50:05,748 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,750 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,761 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,767 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,778 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,789 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,800 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,820 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,830 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,839 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,863 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,870 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,896 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,904 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,910 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,921 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,925 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,933 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,943 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,947 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,950 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,963 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,966 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,968 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,973 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,980 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,988 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,994 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:05,999 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:06,005 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:06,010 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:06,013 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:06,015 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:06,019 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:06,021 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:06,028 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:06,029 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:06,037 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:06,039 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:06,046 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:06,048 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:06,053 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:06,059 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:50:08,245 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1271: assume false; [2021-11-07 01:50:08,245 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1272: assume !false; [2021-11-07 01:50:08,246 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-11-07 01:50:08,247 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-11-07 01:50:08,247 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1230: assume !false; [2021-11-07 01:50:08,247 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##287: assume false; [2021-11-07 01:50:08,247 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##288: assume !false; [2021-11-07 01:50:08,247 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1229: assume false; [2021-11-07 01:50:08,247 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1210: assume false; [2021-11-07 01:50:08,248 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1211: assume !false; [2021-11-07 01:50:08,248 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##319: assume false; [2021-11-07 01:50:08,248 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##320: assume !false; [2021-11-07 01:50:08,249 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1160: assume !false; [2021-11-07 01:50:08,249 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1159: assume false; [2021-11-07 01:50:08,249 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##371: assume false; [2021-11-07 01:50:08,249 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##372: assume !false; [2021-11-07 01:50:08,249 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1108: assume false; [2021-11-07 01:50:08,249 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1109: assume !false; [2021-11-07 01:50:08,250 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##346: assume false; [2021-11-07 01:50:08,250 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##347: assume !false; [2021-11-07 01:50:08,250 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume false; [2021-11-07 01:50:08,250 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##417: assume !false; [2021-11-07 01:50:08,250 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1050: assume !false; [2021-11-07 01:50:08,251 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res := 0; [2021-11-07 01:50:08,251 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1049: assume false; [2021-11-07 01:50:08,251 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1003: assume false; [2021-11-07 01:50:08,251 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1004: assume !false; [2021-11-07 01:50:08,251 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##461: assume !false; [2021-11-07 01:50:08,252 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##460: assume false; [2021-11-07 01:50:08,252 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##487: assume !false; [2021-11-07 01:50:08,252 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##486: assume false; [2021-11-07 01:50:08,252 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##526: assume !false; [2021-11-07 01:50:08,252 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##525: assume false; [2021-11-07 01:50:08,252 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume !false; [2021-11-07 01:50:08,253 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##70: assume false; [2021-11-07 01:50:08,253 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2021-11-07 01:50:08,253 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2021-11-07 01:50:08,253 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2021-11-07 01:50:08,254 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2021-11-07 01:50:08,254 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-11-07 01:50:08,255 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-11-07 01:50:08,255 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##573: assume !false; [2021-11-07 01:50:08,255 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##572: assume false; [2021-11-07 01:50:08,256 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##685: assume !false; [2021-11-07 01:50:08,256 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume false; [2021-11-07 01:50:08,257 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-11-07 01:50:08,257 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-11-07 01:50:08,257 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume !false; [2021-11-07 01:50:08,257 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##638: assume false; [2021-11-07 01:50:08,257 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1612: assume false; [2021-11-07 01:50:08,257 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1613: assume !false; [2021-11-07 01:50:08,258 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##757: assume !false; [2021-11-07 01:50:08,258 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##756: assume false; [2021-11-07 01:50:08,258 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##717: assume !false; [2021-11-07 01:50:08,258 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##716: assume false; [2021-11-07 01:50:08,258 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1506: assume false; [2021-11-07 01:50:08,258 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1507: assume !false; [2021-11-07 01:50:08,259 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1564: assume false; [2021-11-07 01:50:08,259 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1565: assume !false; [2021-11-07 01:50:08,259 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##856: assume false; [2021-11-07 01:50:08,259 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##857: assume !false; [2021-11-07 01:50:08,260 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##801: assume false; [2021-11-07 01:50:08,260 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##802: assume !false; [2021-11-07 01:50:08,260 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##832: assume !false; [2021-11-07 01:50:08,261 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##831: assume false; [2021-11-07 01:50:08,264 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1426: assume false; [2021-11-07 01:50:08,264 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1427: assume !false; [2021-11-07 01:50:08,264 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1476: assume false; [2021-11-07 01:50:08,264 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1477: assume !false; [2021-11-07 01:50:08,265 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1398: assume false; [2021-11-07 01:50:08,266 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1399: assume !false; [2021-11-07 01:50:08,266 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##961: assume !false; [2021-11-07 01:50:08,266 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##960: assume false; [2021-11-07 01:50:08,267 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##909: assume false; [2021-11-07 01:50:08,272 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##910: assume !false; [2021-11-07 01:50:08,273 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1301: assume false; [2021-11-07 01:50:08,273 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1302: assume !false; [2021-11-07 01:50:08,273 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##188: assume !false; [2021-11-07 01:50:08,273 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume false; [2021-11-07 01:50:08,273 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##148: assume false; [2021-11-07 01:50:08,273 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##149: assume !false; [2021-11-07 01:50:08,274 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1354: assume false; [2021-11-07 01:50:08,274 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1355: assume !false; [2021-11-07 01:50:08,274 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1341: assume false; [2021-11-07 01:50:08,274 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1342: assume !false; [2021-11-07 01:50:08,274 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume false; [2021-11-07 01:50:08,274 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !false; [2021-11-07 01:50:11,281 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:50:11,281 INFO L299 CfgBuilder]: Removed 555 assume(true) statements. [2021-11-07 01:50:11,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:50:11 BoogieIcfgContainer [2021-11-07 01:50:11,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:50:11,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:50:11,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:50:11,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:50:11,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:50:03" (1/3) ... [2021-11-07 01:50:11,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb716aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:50:11, skipping insertion in model container [2021-11-07 01:50:11,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:50:04" (2/3) ... [2021-11-07 01:50:11,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb716aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:50:11, skipping insertion in model container [2021-11-07 01:50:11,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:50:11" (3/3) ... [2021-11-07 01:50:11,293 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2021-11-07 01:50:11,299 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:50:11,299 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 103 error locations. [2021-11-07 01:50:11,352 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:50:11,359 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:50:11,359 INFO L340 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2021-11-07 01:50:11,395 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-11-07 01:50:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 01:50:11,401 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:11,402 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:11,403 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-11-07 01:50:11,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:11,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1428884645, now seen corresponding path program 1 times [2021-11-07 01:50:11,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:11,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790195331] [2021-11-07 01:50:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:11,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:11,680 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:11,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790195331] [2021-11-07 01:50:11,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790195331] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:11,681 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:11,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:11,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58132095] [2021-11-07 01:50:11,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:50:11,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:11,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:50:11,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:11,712 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-11-07 01:50:12,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:12,379 INFO L93 Difference]: Finished difference Result 1301 states and 1928 transitions. [2021-11-07 01:50:12,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:50:12,381 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-11-07 01:50:12,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:12,431 INFO L225 Difference]: With dead ends: 1301 [2021-11-07 01:50:12,431 INFO L226 Difference]: Without dead ends: 736 [2021-11-07 01:50:12,445 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:12,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2021-11-07 01:50:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 734. [2021-11-07 01:50:12,547 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-11-07 01:50:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1028 transitions. [2021-11-07 01:50:12,553 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1028 transitions. Word has length 8 [2021-11-07 01:50:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:12,571 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1028 transitions. [2021-11-07 01:50:12,571 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-11-07 01:50:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1028 transitions. [2021-11-07 01:50:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 01:50:12,573 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:12,574 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:12,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:50:12,574 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-11-07 01:50:12,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1293410765, now seen corresponding path program 1 times [2021-11-07 01:50:12,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:12,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446523146] [2021-11-07 01:50:12,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:12,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:12,662 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:12,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446523146] [2021-11-07 01:50:12,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446523146] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:12,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:12,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:12,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477565095] [2021-11-07 01:50:12,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:50:12,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:12,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:50:12,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:12,667 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-11-07 01:50:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:12,738 INFO L93 Difference]: Finished difference Result 931 states and 1280 transitions. [2021-11-07 01:50:12,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:50:12,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-07 01:50:12,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:12,746 INFO L225 Difference]: With dead ends: 931 [2021-11-07 01:50:12,746 INFO L226 Difference]: Without dead ends: 734 [2021-11-07 01:50:12,748 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:12,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2021-11-07 01:50:12,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 629. [2021-11-07 01:50:12,785 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-11-07 01:50:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 887 transitions. [2021-11-07 01:50:12,789 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 887 transitions. Word has length 9 [2021-11-07 01:50:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:12,789 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 887 transitions. [2021-11-07 01:50:12,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:50:12,790 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 887 transitions. [2021-11-07 01:50:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:50:12,792 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:12,793 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:12,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:50:12,793 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-11-07 01:50:12,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:12,794 INFO L85 PathProgramCache]: Analyzing trace with hash -224003595, now seen corresponding path program 1 times [2021-11-07 01:50:12,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:12,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753557948] [2021-11-07 01:50:12,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:12,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:12,860 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:12,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753557948] [2021-11-07 01:50:12,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753557948] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:12,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:12,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:50:12,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237872648] [2021-11-07 01:50:12,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:50:12,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:12,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:50:12,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:12,864 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-11-07 01:50:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:13,269 INFO L93 Difference]: Finished difference Result 651 states and 912 transitions. [2021-11-07 01:50:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:50:13,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-07 01:50:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:13,275 INFO L225 Difference]: With dead ends: 651 [2021-11-07 01:50:13,276 INFO L226 Difference]: Without dead ends: 629 [2021-11-07 01:50:13,276 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-11-07 01:50:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2021-11-07 01:50:13,300 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-11-07 01:50:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 886 transitions. [2021-11-07 01:50:13,303 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 886 transitions. Word has length 10 [2021-11-07 01:50:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:13,303 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 886 transitions. [2021-11-07 01:50:13,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:50:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 886 transitions. [2021-11-07 01:50:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:50:13,311 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:13,311 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:13,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:50:13,312 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-11-07 01:50:13,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash 725022092, now seen corresponding path program 1 times [2021-11-07 01:50:13,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:13,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505016818] [2021-11-07 01:50:13,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:13,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:13,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:13,415 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:13,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505016818] [2021-11-07 01:50:13,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505016818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:13,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:13,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:13,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975590677] [2021-11-07 01:50:13,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:50:13,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:13,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:50:13,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:13,419 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-11-07 01:50:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:13,749 INFO L93 Difference]: Finished difference Result 1041 states and 1426 transitions. [2021-11-07 01:50:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:50:13,749 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-11-07 01:50:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:13,755 INFO L225 Difference]: With dead ends: 1041 [2021-11-07 01:50:13,756 INFO L226 Difference]: Without dead ends: 874 [2021-11-07 01:50:13,757 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-11-07 01:50:13,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 742. [2021-11-07 01:50:13,792 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-11-07 01:50:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1056 transitions. [2021-11-07 01:50:13,796 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1056 transitions. Word has length 12 [2021-11-07 01:50:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:13,797 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 1056 transitions. [2021-11-07 01:50:13,797 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-11-07 01:50:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1056 transitions. [2021-11-07 01:50:13,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:50:13,799 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:13,799 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:13,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:50:13,799 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-11-07 01:50:13,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:13,800 INFO L85 PathProgramCache]: Analyzing trace with hash 993192964, now seen corresponding path program 1 times [2021-11-07 01:50:13,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:13,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572093503] [2021-11-07 01:50:13,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:13,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:13,884 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:13,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572093503] [2021-11-07 01:50:13,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572093503] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:13,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:13,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:13,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610459020] [2021-11-07 01:50:13,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:50:13,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:13,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:50:13,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:50:13,887 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-11-07 01:50:14,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:14,349 INFO L93 Difference]: Finished difference Result 1044 states and 1448 transitions. [2021-11-07 01:50:14,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:50:14,350 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-11-07 01:50:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:14,355 INFO L225 Difference]: With dead ends: 1044 [2021-11-07 01:50:14,356 INFO L226 Difference]: Without dead ends: 629 [2021-11-07 01:50:14,357 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:14,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-11-07 01:50:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 580. [2021-11-07 01:50:14,391 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-11-07 01:50:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 800 transitions. [2021-11-07 01:50:14,397 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 800 transitions. Word has length 13 [2021-11-07 01:50:14,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:14,398 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 800 transitions. [2021-11-07 01:50:14,398 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-11-07 01:50:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 800 transitions. [2021-11-07 01:50:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 01:50:14,400 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:14,400 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:14,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 01:50:14,401 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-11-07 01:50:14,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:14,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1649645807, now seen corresponding path program 1 times [2021-11-07 01:50:14,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:14,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867470431] [2021-11-07 01:50:14,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:14,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:14,473 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:14,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867470431] [2021-11-07 01:50:14,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867470431] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:14,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:14,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:14,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896719395] [2021-11-07 01:50:14,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:50:14,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:14,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:50:14,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:14,477 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-11-07 01:50:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:14,762 INFO L93 Difference]: Finished difference Result 580 states and 800 transitions. [2021-11-07 01:50:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:50:14,763 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-11-07 01:50:14,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:14,767 INFO L225 Difference]: With dead ends: 580 [2021-11-07 01:50:14,768 INFO L226 Difference]: Without dead ends: 562 [2021-11-07 01:50:14,768 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:14,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-11-07 01:50:14,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-11-07 01:50:14,801 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-11-07 01:50:14,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 782 transitions. [2021-11-07 01:50:14,810 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 782 transitions. Word has length 14 [2021-11-07 01:50:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:14,810 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 782 transitions. [2021-11-07 01:50:14,811 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-11-07 01:50:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 782 transitions. [2021-11-07 01:50:14,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 01:50:14,812 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:14,813 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:14,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 01:50:14,813 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-11-07 01:50:14,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:14,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1629262432, now seen corresponding path program 1 times [2021-11-07 01:50:14,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:14,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912264535] [2021-11-07 01:50:14,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:14,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:14,868 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:14,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912264535] [2021-11-07 01:50:14,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912264535] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:14,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:14,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:50:14,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329578287] [2021-11-07 01:50:14,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:50:14,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:14,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:50:14,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:50:14,871 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-11-07 01:50:15,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:15,009 INFO L93 Difference]: Finished difference Result 758 states and 1034 transitions. [2021-11-07 01:50:15,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:50:15,010 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-11-07 01:50:15,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:15,015 INFO L225 Difference]: With dead ends: 758 [2021-11-07 01:50:15,015 INFO L226 Difference]: Without dead ends: 613 [2021-11-07 01:50:15,016 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-11-07 01:50:15,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 552. [2021-11-07 01:50:15,053 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-11-07 01:50:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 766 transitions. [2021-11-07 01:50:15,057 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 766 transitions. Word has length 14 [2021-11-07 01:50:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:15,057 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 766 transitions. [2021-11-07 01:50:15,058 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-11-07 01:50:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 766 transitions. [2021-11-07 01:50:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 01:50:15,059 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:15,060 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:15,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 01:50:15,060 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-11-07 01:50:15,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1145033940, now seen corresponding path program 1 times [2021-11-07 01:50:15,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:15,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149962810] [2021-11-07 01:50:15,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:15,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:15,105 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:15,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149962810] [2021-11-07 01:50:15,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149962810] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:15,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:15,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:15,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503768303] [2021-11-07 01:50:15,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:50:15,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:15,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:50:15,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:15,109 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-11-07 01:50:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:15,168 INFO L93 Difference]: Finished difference Result 606 states and 829 transitions. [2021-11-07 01:50:15,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:50:15,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 01:50:15,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:15,174 INFO L225 Difference]: With dead ends: 606 [2021-11-07 01:50:15,174 INFO L226 Difference]: Without dead ends: 583 [2021-11-07 01:50:15,175 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-11-07 01:50:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 572. [2021-11-07 01:50:15,220 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-11-07 01:50:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 793 transitions. [2021-11-07 01:50:15,224 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 793 transitions. Word has length 17 [2021-11-07 01:50:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:15,225 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 793 transitions. [2021-11-07 01:50:15,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:50:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 793 transitions. [2021-11-07 01:50:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 01:50:15,227 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:15,228 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:15,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 01:50:15,228 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-11-07 01:50:15,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:15,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1721362675, now seen corresponding path program 1 times [2021-11-07 01:50:15,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:15,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302528182] [2021-11-07 01:50:15,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:15,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:15,305 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:15,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302528182] [2021-11-07 01:50:15,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302528182] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:15,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:15,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:15,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218466124] [2021-11-07 01:50:15,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:50:15,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:15,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:50:15,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:15,308 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-11-07 01:50:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:15,580 INFO L93 Difference]: Finished difference Result 700 states and 965 transitions. [2021-11-07 01:50:15,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:50:15,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-07 01:50:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:15,585 INFO L225 Difference]: With dead ends: 700 [2021-11-07 01:50:15,586 INFO L226 Difference]: Without dead ends: 562 [2021-11-07 01:50:15,591 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-11-07 01:50:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-11-07 01:50:15,629 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-11-07 01:50:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 778 transitions. [2021-11-07 01:50:15,633 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 778 transitions. Word has length 19 [2021-11-07 01:50:15,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:15,634 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 778 transitions. [2021-11-07 01:50:15,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:50:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 778 transitions. [2021-11-07 01:50:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:50:15,637 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:15,637 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:15,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 01:50:15,639 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-11-07 01:50:15,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1713187916, now seen corresponding path program 1 times [2021-11-07 01:50:15,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:15,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355669547] [2021-11-07 01:50:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:15,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:15,722 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:15,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355669547] [2021-11-07 01:50:15,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355669547] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:15,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:15,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:15,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979430695] [2021-11-07 01:50:15,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:50:15,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:15,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:50:15,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:15,726 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-11-07 01:50:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:16,014 INFO L93 Difference]: Finished difference Result 689 states and 939 transitions. [2021-11-07 01:50:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:50:16,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:50:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:16,020 INFO L225 Difference]: With dead ends: 689 [2021-11-07 01:50:16,020 INFO L226 Difference]: Without dead ends: 673 [2021-11-07 01:50:16,021 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:16,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-11-07 01:50:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 597. [2021-11-07 01:50:16,061 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-11-07 01:50:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 817 transitions. [2021-11-07 01:50:16,065 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 817 transitions. Word has length 21 [2021-11-07 01:50:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:16,065 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 817 transitions. [2021-11-07 01:50:16,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:50:16,066 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 817 transitions. [2021-11-07 01:50:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:50:16,068 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:16,068 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:16,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 01:50:16,069 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-11-07 01:50:16,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:16,069 INFO L85 PathProgramCache]: Analyzing trace with hash -884532789, now seen corresponding path program 1 times [2021-11-07 01:50:16,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:16,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342605297] [2021-11-07 01:50:16,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:16,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:16,129 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:16,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342605297] [2021-11-07 01:50:16,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342605297] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:16,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:16,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:16,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535062522] [2021-11-07 01:50:16,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:50:16,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:16,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:50:16,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:16,145 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-11-07 01:50:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:16,407 INFO L93 Difference]: Finished difference Result 621 states and 843 transitions. [2021-11-07 01:50:16,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:50:16,408 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-11-07 01:50:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:16,413 INFO L225 Difference]: With dead ends: 621 [2021-11-07 01:50:16,413 INFO L226 Difference]: Without dead ends: 616 [2021-11-07 01:50:16,414 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:16,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2021-11-07 01:50:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2021-11-07 01:50:16,453 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-11-07 01:50:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 836 transitions. [2021-11-07 01:50:16,457 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 836 transitions. Word has length 22 [2021-11-07 01:50:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:16,458 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 836 transitions. [2021-11-07 01:50:16,458 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-11-07 01:50:16,458 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 836 transitions. [2021-11-07 01:50:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:50:16,460 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:16,460 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:16,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 01:50:16,461 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-11-07 01:50:16,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1586442508, now seen corresponding path program 1 times [2021-11-07 01:50:16,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:16,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043980866] [2021-11-07 01:50:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:16,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:16,506 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:16,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043980866] [2021-11-07 01:50:16,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043980866] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:16,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:16,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:16,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046932585] [2021-11-07 01:50:16,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:50:16,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:16,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:50:16,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:50:16,510 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-11-07 01:50:16,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:16,903 INFO L93 Difference]: Finished difference Result 703 states and 953 transitions. [2021-11-07 01:50:16,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:50:16,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 01:50:16,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:16,909 INFO L225 Difference]: With dead ends: 703 [2021-11-07 01:50:16,909 INFO L226 Difference]: Without dead ends: 691 [2021-11-07 01:50:16,910 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:16,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2021-11-07 01:50:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 613. [2021-11-07 01:50:16,956 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-11-07 01:50:16,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 834 transitions. [2021-11-07 01:50:16,959 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 834 transitions. Word has length 22 [2021-11-07 01:50:16,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:16,960 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 834 transitions. [2021-11-07 01:50:16,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:50:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 834 transitions. [2021-11-07 01:50:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:50:16,962 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:16,962 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:16,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 01:50:16,963 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-11-07 01:50:16,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:16,964 INFO L85 PathProgramCache]: Analyzing trace with hash 640427871, now seen corresponding path program 1 times [2021-11-07 01:50:16,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:16,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450269172] [2021-11-07 01:50:16,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:16,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:17,010 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:17,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450269172] [2021-11-07 01:50:17,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450269172] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:17,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:17,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:17,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988841334] [2021-11-07 01:50:17,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:50:17,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:17,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:50:17,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:50:17,013 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-11-07 01:50:17,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:17,363 INFO L93 Difference]: Finished difference Result 648 states and 870 transitions. [2021-11-07 01:50:17,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:50:17,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 01:50:17,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:17,368 INFO L225 Difference]: With dead ends: 648 [2021-11-07 01:50:17,369 INFO L226 Difference]: Without dead ends: 613 [2021-11-07 01:50:17,369 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-11-07 01:50:17,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2021-11-07 01:50:17,417 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-11-07 01:50:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 825 transitions. [2021-11-07 01:50:17,420 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 825 transitions. Word has length 22 [2021-11-07 01:50:17,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:17,421 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 825 transitions. [2021-11-07 01:50:17,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:50:17,421 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 825 transitions. [2021-11-07 01:50:17,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:50:17,423 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:17,423 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:17,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 01:50:17,424 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-11-07 01:50:17,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:17,425 INFO L85 PathProgramCache]: Analyzing trace with hash 162403822, now seen corresponding path program 1 times [2021-11-07 01:50:17,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:17,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92023493] [2021-11-07 01:50:17,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:17,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:17,466 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:17,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92023493] [2021-11-07 01:50:17,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92023493] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:17,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:17,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:17,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674131117] [2021-11-07 01:50:17,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:50:17,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:17,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:50:17,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:17,469 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-11-07 01:50:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:17,534 INFO L93 Difference]: Finished difference Result 665 states and 890 transitions. [2021-11-07 01:50:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:50:17,535 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-11-07 01:50:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:17,539 INFO L225 Difference]: With dead ends: 665 [2021-11-07 01:50:17,539 INFO L226 Difference]: Without dead ends: 596 [2021-11-07 01:50:17,540 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-11-07 01:50:17,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2021-11-07 01:50:17,590 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-11-07 01:50:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 796 transitions. [2021-11-07 01:50:17,593 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 796 transitions. Word has length 22 [2021-11-07 01:50:17,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:17,594 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 796 transitions. [2021-11-07 01:50:17,594 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-11-07 01:50:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 796 transitions. [2021-11-07 01:50:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:50:17,596 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:17,596 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:17,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 01:50:17,597 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-11-07 01:50:17,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2130497339, now seen corresponding path program 1 times [2021-11-07 01:50:17,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:17,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017058219] [2021-11-07 01:50:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:17,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:17,651 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:17,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017058219] [2021-11-07 01:50:17,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017058219] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:17,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:17,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:50:17,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936033464] [2021-11-07 01:50:17,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:50:17,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:17,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:50:17,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:50:17,655 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-11-07 01:50:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:17,738 INFO L93 Difference]: Finished difference Result 712 states and 942 transitions. [2021-11-07 01:50:17,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:50:17,739 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-11-07 01:50:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:17,744 INFO L225 Difference]: With dead ends: 712 [2021-11-07 01:50:17,744 INFO L226 Difference]: Without dead ends: 638 [2021-11-07 01:50:17,745 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-11-07 01:50:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 588. [2021-11-07 01:50:17,790 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-11-07 01:50:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 784 transitions. [2021-11-07 01:50:17,794 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 784 transitions. Word has length 22 [2021-11-07 01:50:17,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:17,794 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 784 transitions. [2021-11-07 01:50:17,795 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-11-07 01:50:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 784 transitions. [2021-11-07 01:50:17,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:50:17,797 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:17,797 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:17,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 01:50:17,797 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-11-07 01:50:17,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:17,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1633499935, now seen corresponding path program 1 times [2021-11-07 01:50:17,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:17,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092007868] [2021-11-07 01:50:17,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:17,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:17,842 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:17,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092007868] [2021-11-07 01:50:17,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092007868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:17,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:17,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:17,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695278627] [2021-11-07 01:50:17,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:50:17,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:17,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:50:17,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:50:17,845 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-11-07 01:50:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:18,131 INFO L93 Difference]: Finished difference Result 596 states and 790 transitions. [2021-11-07 01:50:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:50:18,132 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-11-07 01:50:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:18,136 INFO L225 Difference]: With dead ends: 596 [2021-11-07 01:50:18,136 INFO L226 Difference]: Without dead ends: 591 [2021-11-07 01:50:18,137 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-11-07 01:50:18,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 588. [2021-11-07 01:50:18,224 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-11-07 01:50:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 783 transitions. [2021-11-07 01:50:18,227 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 783 transitions. Word has length 23 [2021-11-07 01:50:18,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:18,228 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 783 transitions. [2021-11-07 01:50:18,228 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-11-07 01:50:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 783 transitions. [2021-11-07 01:50:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:50:18,230 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:18,230 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:18,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 01:50:18,231 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-11-07 01:50:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:18,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1412842791, now seen corresponding path program 1 times [2021-11-07 01:50:18,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:18,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547988703] [2021-11-07 01:50:18,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:18,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:18,274 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:18,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547988703] [2021-11-07 01:50:18,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547988703] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:18,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:18,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:18,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644448949] [2021-11-07 01:50:18,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:50:18,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:18,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:50:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:50:18,277 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-11-07 01:50:18,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:18,618 INFO L93 Difference]: Finished difference Result 605 states and 799 transitions. [2021-11-07 01:50:18,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:50:18,619 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-11-07 01:50:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:18,623 INFO L225 Difference]: With dead ends: 605 [2021-11-07 01:50:18,624 INFO L226 Difference]: Without dead ends: 575 [2021-11-07 01:50:18,624 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:18,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-11-07 01:50:18,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2021-11-07 01:50:18,672 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-11-07 01:50:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 761 transitions. [2021-11-07 01:50:18,676 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 761 transitions. Word has length 23 [2021-11-07 01:50:18,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:18,676 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 761 transitions. [2021-11-07 01:50:18,676 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-11-07 01:50:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 761 transitions. [2021-11-07 01:50:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:50:18,678 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:18,678 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:18,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 01:50:18,679 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-11-07 01:50:18,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1360030513, now seen corresponding path program 1 times [2021-11-07 01:50:18,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:18,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029859717] [2021-11-07 01:50:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:18,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:18,714 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:18,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029859717] [2021-11-07 01:50:18,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029859717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:18,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:18,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:18,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359099561] [2021-11-07 01:50:18,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:50:18,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:18,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:50:18,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:18,717 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-11-07 01:50:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:18,938 INFO L93 Difference]: Finished difference Result 609 states and 795 transitions. [2021-11-07 01:50:18,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:50:18,939 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-11-07 01:50:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:18,943 INFO L225 Difference]: With dead ends: 609 [2021-11-07 01:50:18,943 INFO L226 Difference]: Without dead ends: 595 [2021-11-07 01:50:18,944 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:18,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2021-11-07 01:50:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 583. [2021-11-07 01:50:18,992 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-11-07 01:50:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 769 transitions. [2021-11-07 01:50:18,995 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 769 transitions. Word has length 23 [2021-11-07 01:50:18,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:18,995 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 769 transitions. [2021-11-07 01:50:18,996 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-11-07 01:50:18,996 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 769 transitions. [2021-11-07 01:50:18,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:50:18,998 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:18,998 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:18,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 01:50:18,998 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-11-07 01:50:18,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:18,999 INFO L85 PathProgramCache]: Analyzing trace with hash 379232346, now seen corresponding path program 1 times [2021-11-07 01:50:18,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:18,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924472057] [2021-11-07 01:50:19,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:19,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:19,055 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:19,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924472057] [2021-11-07 01:50:19,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924472057] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:19,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:19,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:19,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317529201] [2021-11-07 01:50:19,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:50:19,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:19,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:50:19,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:50:19,058 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-11-07 01:50:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:19,376 INFO L93 Difference]: Finished difference Result 591 states and 775 transitions. [2021-11-07 01:50:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:50:19,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-07 01:50:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:19,381 INFO L225 Difference]: With dead ends: 591 [2021-11-07 01:50:19,381 INFO L226 Difference]: Without dead ends: 586 [2021-11-07 01:50:19,382 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-11-07 01:50:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 583. [2021-11-07 01:50:19,430 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-11-07 01:50:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 768 transitions. [2021-11-07 01:50:19,434 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 768 transitions. Word has length 24 [2021-11-07 01:50:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:19,434 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 768 transitions. [2021-11-07 01:50:19,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:50:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 768 transitions. [2021-11-07 01:50:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:50:19,436 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:19,436 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:19,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 01:50:19,437 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-11-07 01:50:19,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:19,438 INFO L85 PathProgramCache]: Analyzing trace with hash -771502393, now seen corresponding path program 1 times [2021-11-07 01:50:19,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:19,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948296067] [2021-11-07 01:50:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:19,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:19,530 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:19,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948296067] [2021-11-07 01:50:19,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948296067] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:19,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:19,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:50:19,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443945436] [2021-11-07 01:50:19,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:50:19,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:19,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:50:19,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:50:19,533 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-11-07 01:50:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:19,647 INFO L93 Difference]: Finished difference Result 597 states and 781 transitions. [2021-11-07 01:50:19,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:50:19,648 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-11-07 01:50:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:19,652 INFO L225 Difference]: With dead ends: 597 [2021-11-07 01:50:19,653 INFO L226 Difference]: Without dead ends: 594 [2021-11-07 01:50:19,653 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-11-07 01:50:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 589. [2021-11-07 01:50:19,726 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-11-07 01:50:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 774 transitions. [2021-11-07 01:50:19,729 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 774 transitions. Word has length 24 [2021-11-07 01:50:19,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:19,729 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 774 transitions. [2021-11-07 01:50:19,730 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-11-07 01:50:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 774 transitions. [2021-11-07 01:50:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:50:19,732 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:19,732 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:19,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 01:50:19,733 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-11-07 01:50:19,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:19,733 INFO L85 PathProgramCache]: Analyzing trace with hash -771514309, now seen corresponding path program 1 times [2021-11-07 01:50:19,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:19,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293607750] [2021-11-07 01:50:19,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:19,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:19,791 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:19,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293607750] [2021-11-07 01:50:19,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293607750] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:19,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:19,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:19,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915908413] [2021-11-07 01:50:19,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:50:19,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:19,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:50:19,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:50:19,795 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-11-07 01:50:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:20,094 INFO L93 Difference]: Finished difference Result 603 states and 787 transitions. [2021-11-07 01:50:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:50:20,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-07 01:50:20,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:20,099 INFO L225 Difference]: With dead ends: 603 [2021-11-07 01:50:20,099 INFO L226 Difference]: Without dead ends: 583 [2021-11-07 01:50:20,099 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:20,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-11-07 01:50:20,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 577. [2021-11-07 01:50:20,149 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-11-07 01:50:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 762 transitions. [2021-11-07 01:50:20,152 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 762 transitions. Word has length 24 [2021-11-07 01:50:20,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:20,153 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 762 transitions. [2021-11-07 01:50:20,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:50:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 762 transitions. [2021-11-07 01:50:20,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:50:20,155 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:20,155 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:20,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 01:50:20,155 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-11-07 01:50:20,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:20,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1481572040, now seen corresponding path program 1 times [2021-11-07 01:50:20,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:20,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145973259] [2021-11-07 01:50:20,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:20,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:20,248 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:20,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145973259] [2021-11-07 01:50:20,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145973259] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:20,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:20,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:50:20,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917979114] [2021-11-07 01:50:20,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:50:20,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:20,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:50:20,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:50:20,251 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-11-07 01:50:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:20,489 INFO L93 Difference]: Finished difference Result 595 states and 779 transitions. [2021-11-07 01:50:20,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:50:20,490 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-11-07 01:50:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:20,494 INFO L225 Difference]: With dead ends: 595 [2021-11-07 01:50:20,494 INFO L226 Difference]: Without dead ends: 572 [2021-11-07 01:50:20,495 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:50:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-11-07 01:50:20,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2021-11-07 01:50:20,541 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-11-07 01:50:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 747 transitions. [2021-11-07 01:50:20,544 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 747 transitions. Word has length 25 [2021-11-07 01:50:20,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:20,544 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 747 transitions. [2021-11-07 01:50:20,544 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-11-07 01:50:20,545 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 747 transitions. [2021-11-07 01:50:20,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:50:20,546 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:20,546 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:20,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 01:50:20,547 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-11-07 01:50:20,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:20,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1652194093, now seen corresponding path program 1 times [2021-11-07 01:50:20,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:20,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829629833] [2021-11-07 01:50:20,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:20,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:20,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:20,621 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:20,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829629833] [2021-11-07 01:50:20,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829629833] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:20,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:20,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 01:50:20,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235859057] [2021-11-07 01:50:20,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 01:50:20,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:20,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 01:50:20,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:50:20,624 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-11-07 01:50:20,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:20,811 INFO L93 Difference]: Finished difference Result 590 states and 764 transitions. [2021-11-07 01:50:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:50:20,812 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-11-07 01:50:20,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:20,816 INFO L225 Difference]: With dead ends: 590 [2021-11-07 01:50:20,816 INFO L226 Difference]: Without dead ends: 569 [2021-11-07 01:50:20,817 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-07 01:50:20,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-11-07 01:50:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2021-11-07 01:50:20,863 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-11-07 01:50:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 733 transitions. [2021-11-07 01:50:20,866 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 733 transitions. Word has length 25 [2021-11-07 01:50:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:20,866 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 733 transitions. [2021-11-07 01:50:20,866 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-11-07 01:50:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 733 transitions. [2021-11-07 01:50:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 01:50:20,868 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:20,868 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:20,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 01:50:20,869 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-11-07 01:50:20,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1306896656, now seen corresponding path program 1 times [2021-11-07 01:50:20,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:20,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54918886] [2021-11-07 01:50:20,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:20,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:20,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-11-07 01:50:20,931 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:20,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54918886] [2021-11-07 01:50:20,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54918886] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:20,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:20,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:50:20,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644385304] [2021-11-07 01:50:20,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:50:20,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:20,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:50:20,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:50:20,934 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-11-07 01:50:21,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:21,083 INFO L93 Difference]: Finished difference Result 584 states and 747 transitions. [2021-11-07 01:50:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:50:21,084 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-11-07 01:50:21,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:21,088 INFO L225 Difference]: With dead ends: 584 [2021-11-07 01:50:21,088 INFO L226 Difference]: Without dead ends: 563 [2021-11-07 01:50:21,089 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:50:21,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-11-07 01:50:21,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2021-11-07 01:50:21,167 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-11-07 01:50:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 724 transitions. [2021-11-07 01:50:21,170 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 724 transitions. Word has length 26 [2021-11-07 01:50:21,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:21,171 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 724 transitions. [2021-11-07 01:50:21,171 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-11-07 01:50:21,171 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 724 transitions. [2021-11-07 01:50:21,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 01:50:21,173 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:21,174 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:21,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 01:50:21,175 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-11-07 01:50:21,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:21,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2107388639, now seen corresponding path program 1 times [2021-11-07 01:50:21,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:21,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678894870] [2021-11-07 01:50:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:21,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:21,378 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:21,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678894870] [2021-11-07 01:50:21,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678894870] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:21,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:21,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:50:21,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448231869] [2021-11-07 01:50:21,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:50:21,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:21,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:50:21,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:21,381 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-11-07 01:50:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:21,589 INFO L93 Difference]: Finished difference Result 654 states and 835 transitions. [2021-11-07 01:50:21,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:50:21,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-07 01:50:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:21,594 INFO L225 Difference]: With dead ends: 654 [2021-11-07 01:50:21,594 INFO L226 Difference]: Without dead ends: 572 [2021-11-07 01:50:21,595 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:50:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-11-07 01:50:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 559. [2021-11-07 01:50:21,691 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-11-07 01:50:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 718 transitions. [2021-11-07 01:50:21,695 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 718 transitions. Word has length 26 [2021-11-07 01:50:21,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:21,695 INFO L470 AbstractCegarLoop]: Abstraction has 559 states and 718 transitions. [2021-11-07 01:50:21,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:50:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 718 transitions. [2021-11-07 01:50:21,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 01:50:21,698 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:21,698 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:21,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 01:50:21,699 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-11-07 01:50:21,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:21,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1658430507, now seen corresponding path program 1 times [2021-11-07 01:50:21,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:21,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544981001] [2021-11-07 01:50:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:21,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:21,748 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:21,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544981001] [2021-11-07 01:50:21,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544981001] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:21,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:21,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:50:21,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741469579] [2021-11-07 01:50:21,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:50:21,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:21,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:50:21,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:21,751 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-11-07 01:50:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:21,969 INFO L93 Difference]: Finished difference Result 583 states and 740 transitions. [2021-11-07 01:50:21,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:50:21,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-07 01:50:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:21,973 INFO L225 Difference]: With dead ends: 583 [2021-11-07 01:50:21,974 INFO L226 Difference]: Without dead ends: 555 [2021-11-07 01:50:21,974 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:50:21,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-11-07 01:50:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 542. [2021-11-07 01:50:22,019 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-11-07 01:50:22,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 699 transitions. [2021-11-07 01:50:22,022 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 699 transitions. Word has length 26 [2021-11-07 01:50:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:22,022 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 699 transitions. [2021-11-07 01:50:22,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:50:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 699 transitions. [2021-11-07 01:50:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 01:50:22,024 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:22,024 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:22,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-07 01:50:22,025 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-11-07 01:50:22,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1504423283, now seen corresponding path program 1 times [2021-11-07 01:50:22,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:22,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704229404] [2021-11-07 01:50:22,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:22,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:22,102 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:22,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704229404] [2021-11-07 01:50:22,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704229404] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:22,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:22,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:50:22,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972461668] [2021-11-07 01:50:22,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:50:22,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:22,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:50:22,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:22,105 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-11-07 01:50:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:22,314 INFO L93 Difference]: Finished difference Result 567 states and 722 transitions. [2021-11-07 01:50:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:50:22,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-07 01:50:22,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:22,319 INFO L225 Difference]: With dead ends: 567 [2021-11-07 01:50:22,319 INFO L226 Difference]: Without dead ends: 547 [2021-11-07 01:50:22,320 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:50:22,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-11-07 01:50:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 534. [2021-11-07 01:50:22,371 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-11-07 01:50:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 690 transitions. [2021-11-07 01:50:22,374 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 690 transitions. Word has length 27 [2021-11-07 01:50:22,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:22,375 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 690 transitions. [2021-11-07 01:50:22,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:50:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 690 transitions. [2021-11-07 01:50:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 01:50:22,377 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:22,377 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:22,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-07 01:50:22,378 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-11-07 01:50:22,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:22,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1155960076, now seen corresponding path program 1 times [2021-11-07 01:50:22,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:22,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066498640] [2021-11-07 01:50:22,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:22,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:22,441 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:22,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066498640] [2021-11-07 01:50:22,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066498640] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:22,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:22,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:50:22,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416688359] [2021-11-07 01:50:22,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:50:22,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:22,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:50:22,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:50:22,444 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-11-07 01:50:22,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:22,559 INFO L93 Difference]: Finished difference Result 549 states and 704 transitions. [2021-11-07 01:50:22,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:50:22,560 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-11-07 01:50:22,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:22,563 INFO L225 Difference]: With dead ends: 549 [2021-11-07 01:50:22,564 INFO L226 Difference]: Without dead ends: 532 [2021-11-07 01:50:22,564 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:50:22,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-11-07 01:50:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2021-11-07 01:50:22,618 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-11-07 01:50:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 687 transitions. [2021-11-07 01:50:22,621 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 687 transitions. Word has length 27 [2021-11-07 01:50:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:22,621 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 687 transitions. [2021-11-07 01:50:22,622 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-11-07 01:50:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 687 transitions. [2021-11-07 01:50:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 01:50:22,623 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:22,624 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:22,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-07 01:50:22,624 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-11-07 01:50:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1611200436, now seen corresponding path program 1 times [2021-11-07 01:50:22,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:22,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626053577] [2021-11-07 01:50:22,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:22,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:22,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:22,659 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:22,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626053577] [2021-11-07 01:50:22,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626053577] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:22,660 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:22,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:50:22,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834836063] [2021-11-07 01:50:22,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:50:22,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:22,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:50:22,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:50:22,662 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-11-07 01:50:22,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:22,905 INFO L93 Difference]: Finished difference Result 634 states and 803 transitions. [2021-11-07 01:50:22,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:50:22,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-07 01:50:22,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:22,910 INFO L225 Difference]: With dead ends: 634 [2021-11-07 01:50:22,911 INFO L226 Difference]: Without dead ends: 615 [2021-11-07 01:50:22,912 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:22,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-11-07 01:50:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 532. [2021-11-07 01:50:22,967 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-11-07 01:50:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 686 transitions. [2021-11-07 01:50:22,971 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 686 transitions. Word has length 27 [2021-11-07 01:50:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:22,971 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 686 transitions. [2021-11-07 01:50:22,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:50:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 686 transitions. [2021-11-07 01:50:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 01:50:22,976 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:22,977 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:22,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 01:50:22,977 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-11-07 01:50:22,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:22,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1713212070, now seen corresponding path program 1 times [2021-11-07 01:50:22,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:22,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745685446] [2021-11-07 01:50:22,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:22,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:23,041 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:23,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745685446] [2021-11-07 01:50:23,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745685446] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:23,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:23,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:23,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603051835] [2021-11-07 01:50:23,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:50:23,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:23,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:50:23,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:50:23,044 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-11-07 01:50:23,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:23,335 INFO L93 Difference]: Finished difference Result 641 states and 818 transitions. [2021-11-07 01:50:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:50:23,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-07 01:50:23,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:23,340 INFO L225 Difference]: With dead ends: 641 [2021-11-07 01:50:23,340 INFO L226 Difference]: Without dead ends: 532 [2021-11-07 01:50:23,342 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:23,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-11-07 01:50:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2021-11-07 01:50:23,398 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-11-07 01:50:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 682 transitions. [2021-11-07 01:50:23,401 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 682 transitions. Word has length 27 [2021-11-07 01:50:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:23,401 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 682 transitions. [2021-11-07 01:50:23,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:50:23,402 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 682 transitions. [2021-11-07 01:50:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 01:50:23,403 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:23,404 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:23,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 01:50:23,404 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-11-07 01:50:23,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:23,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1843803493, now seen corresponding path program 1 times [2021-11-07 01:50:23,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:23,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863056817] [2021-11-07 01:50:23,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:23,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:23,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-11-07 01:50:23,456 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:23,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863056817] [2021-11-07 01:50:23,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863056817] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:23,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:23,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:50:23,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364372306] [2021-11-07 01:50:23,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:50:23,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:23,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:50:23,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:23,459 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-11-07 01:50:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:23,596 INFO L93 Difference]: Finished difference Result 616 states and 769 transitions. [2021-11-07 01:50:23,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:50:23,597 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-11-07 01:50:23,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:23,601 INFO L225 Difference]: With dead ends: 616 [2021-11-07 01:50:23,601 INFO L226 Difference]: Without dead ends: 599 [2021-11-07 01:50:23,602 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:50:23,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-11-07 01:50:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 542. [2021-11-07 01:50:23,659 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-11-07 01:50:23,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 695 transitions. [2021-11-07 01:50:23,662 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 695 transitions. Word has length 28 [2021-11-07 01:50:23,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:23,663 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 695 transitions. [2021-11-07 01:50:23,663 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-11-07 01:50:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 695 transitions. [2021-11-07 01:50:23,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 01:50:23,665 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:23,665 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:23,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 01:50:23,666 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-11-07 01:50:23,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:23,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1622268006, now seen corresponding path program 1 times [2021-11-07 01:50:23,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:23,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990923768] [2021-11-07 01:50:23,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:23,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:23,728 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:23,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990923768] [2021-11-07 01:50:23,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990923768] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:23,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:23,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:50:23,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085639007] [2021-11-07 01:50:23,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:50:23,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:23,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:50:23,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:50:23,732 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-11-07 01:50:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:23,919 INFO L93 Difference]: Finished difference Result 557 states and 709 transitions. [2021-11-07 01:50:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:50:23,920 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-11-07 01:50:23,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:23,924 INFO L225 Difference]: With dead ends: 557 [2021-11-07 01:50:23,924 INFO L226 Difference]: Without dead ends: 536 [2021-11-07 01:50:23,926 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:50:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-11-07 01:50:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2021-11-07 01:50:23,981 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-11-07 01:50:23,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 686 transitions. [2021-11-07 01:50:23,984 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 686 transitions. Word has length 28 [2021-11-07 01:50:23,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:23,985 INFO L470 AbstractCegarLoop]: Abstraction has 536 states and 686 transitions. [2021-11-07 01:50:23,985 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-11-07 01:50:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 686 transitions. [2021-11-07 01:50:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 01:50:23,987 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:23,987 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:23,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 01:50:23,987 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-11-07 01:50:23,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:23,988 INFO L85 PathProgramCache]: Analyzing trace with hash -453382508, now seen corresponding path program 1 times [2021-11-07 01:50:23,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:23,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157086576] [2021-11-07 01:50:23,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:23,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:24,099 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:24,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157086576] [2021-11-07 01:50:24,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157086576] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:24,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:24,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:50:24,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428680359] [2021-11-07 01:50:24,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:50:24,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:24,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:50:24,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:50:24,102 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-11-07 01:50:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:24,358 INFO L93 Difference]: Finished difference Result 561 states and 709 transitions. [2021-11-07 01:50:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:50:24,370 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-11-07 01:50:24,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:24,384 INFO L225 Difference]: With dead ends: 561 [2021-11-07 01:50:24,384 INFO L226 Difference]: Without dead ends: 540 [2021-11-07 01:50:24,385 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:50:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-11-07 01:50:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 527. [2021-11-07 01:50:24,471 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-11-07 01:50:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 676 transitions. [2021-11-07 01:50:24,475 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 676 transitions. Word has length 28 [2021-11-07 01:50:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:24,475 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 676 transitions. [2021-11-07 01:50:24,475 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-11-07 01:50:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 676 transitions. [2021-11-07 01:50:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 01:50:24,477 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:24,478 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:24,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-07 01:50:24,478 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-11-07 01:50:24,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:24,479 INFO L85 PathProgramCache]: Analyzing trace with hash 695346116, now seen corresponding path program 1 times [2021-11-07 01:50:24,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:24,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137510218] [2021-11-07 01:50:24,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:24,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:24,527 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:24,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137510218] [2021-11-07 01:50:24,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137510218] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:24,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:24,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:50:24,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128253117] [2021-11-07 01:50:24,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:50:24,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:24,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:50:24,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:50:24,530 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-11-07 01:50:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:24,779 INFO L93 Difference]: Finished difference Result 565 states and 716 transitions. [2021-11-07 01:50:24,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:50:24,780 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-11-07 01:50:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:24,784 INFO L225 Difference]: With dead ends: 565 [2021-11-07 01:50:24,784 INFO L226 Difference]: Without dead ends: 561 [2021-11-07 01:50:24,785 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:50:24,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2021-11-07 01:50:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 500. [2021-11-07 01:50:24,839 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-11-07 01:50:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 640 transitions. [2021-11-07 01:50:24,841 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 640 transitions. Word has length 28 [2021-11-07 01:50:24,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:24,842 INFO L470 AbstractCegarLoop]: Abstraction has 500 states and 640 transitions. [2021-11-07 01:50:24,842 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-11-07 01:50:24,842 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 640 transitions. [2021-11-07 01:50:24,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 01:50:24,844 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:24,844 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:24,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-07 01:50:24,845 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-11-07 01:50:24,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:24,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1529539768, now seen corresponding path program 1 times [2021-11-07 01:50:24,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:24,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036600470] [2021-11-07 01:50:24,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:24,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:24,917 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:24,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036600470] [2021-11-07 01:50:24,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036600470] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:24,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:24,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 01:50:24,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751256145] [2021-11-07 01:50:24,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 01:50:24,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:24,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 01:50:24,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:50:24,920 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-11-07 01:50:25,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:25,376 INFO L93 Difference]: Finished difference Result 631 states and 789 transitions. [2021-11-07 01:50:25,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:50:25,377 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-11-07 01:50:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:25,381 INFO L225 Difference]: With dead ends: 631 [2021-11-07 01:50:25,382 INFO L226 Difference]: Without dead ends: 565 [2021-11-07 01:50:25,383 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-07 01:50:25,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-11-07 01:50:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 503. [2021-11-07 01:50:25,437 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-11-07 01:50:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 636 transitions. [2021-11-07 01:50:25,439 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 636 transitions. Word has length 29 [2021-11-07 01:50:25,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:25,440 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 636 transitions. [2021-11-07 01:50:25,440 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-11-07 01:50:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 636 transitions. [2021-11-07 01:50:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 01:50:25,442 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:25,442 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:25,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-07 01:50:25,443 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-11-07 01:50:25,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:25,443 INFO L85 PathProgramCache]: Analyzing trace with hash -120439325, now seen corresponding path program 1 times [2021-11-07 01:50:25,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:25,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910739378] [2021-11-07 01:50:25,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:25,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:25,496 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:25,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910739378] [2021-11-07 01:50:25,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910739378] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:25,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:25,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:50:25,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057961565] [2021-11-07 01:50:25,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:50:25,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:25,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:50:25,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:50:25,498 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-11-07 01:50:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:25,658 INFO L93 Difference]: Finished difference Result 522 states and 654 transitions. [2021-11-07 01:50:25,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:50:25,663 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-11-07 01:50:25,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:25,669 INFO L225 Difference]: With dead ends: 522 [2021-11-07 01:50:25,669 INFO L226 Difference]: Without dead ends: 496 [2021-11-07 01:50:25,670 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:50:25,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-11-07 01:50:25,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2021-11-07 01:50:25,721 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-11-07 01:50:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 624 transitions. [2021-11-07 01:50:25,724 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 624 transitions. Word has length 29 [2021-11-07 01:50:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:25,724 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 624 transitions. [2021-11-07 01:50:25,724 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-11-07 01:50:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 624 transitions. [2021-11-07 01:50:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 01:50:25,726 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:25,726 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:25,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-07 01:50:25,727 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-11-07 01:50:25,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:25,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1964448463, now seen corresponding path program 1 times [2021-11-07 01:50:25,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:25,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688447130] [2021-11-07 01:50:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:25,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:25,757 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:25,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688447130] [2021-11-07 01:50:25,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688447130] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:25,758 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:25,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:25,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319973925] [2021-11-07 01:50:25,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:50:25,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:25,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:50:25,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:25,761 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-11-07 01:50:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:25,830 INFO L93 Difference]: Finished difference Result 534 states and 659 transitions. [2021-11-07 01:50:25,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:50:25,831 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-11-07 01:50:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:25,834 INFO L225 Difference]: With dead ends: 534 [2021-11-07 01:50:25,835 INFO L226 Difference]: Without dead ends: 514 [2021-11-07 01:50:25,835 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-11-07 01:50:25,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 496. [2021-11-07 01:50:25,888 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-11-07 01:50:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 623 transitions. [2021-11-07 01:50:25,890 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 623 transitions. Word has length 29 [2021-11-07 01:50:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:25,890 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 623 transitions. [2021-11-07 01:50:25,890 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-11-07 01:50:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 623 transitions. [2021-11-07 01:50:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 01:50:25,892 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:25,892 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:25,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-07 01:50:25,893 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-11-07 01:50:25,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:25,893 INFO L85 PathProgramCache]: Analyzing trace with hash 644489272, now seen corresponding path program 1 times [2021-11-07 01:50:25,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:25,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423647133] [2021-11-07 01:50:25,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:25,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:25,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-11-07 01:50:25,970 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:25,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423647133] [2021-11-07 01:50:25,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423647133] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:25,971 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:25,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:50:25,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928254130] [2021-11-07 01:50:25,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:50:25,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:25,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:50:25,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:50:25,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-11-07 01:50:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:26,210 INFO L93 Difference]: Finished difference Result 526 states and 650 transitions. [2021-11-07 01:50:26,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:50:26,210 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-11-07 01:50:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:26,214 INFO L225 Difference]: With dead ends: 526 [2021-11-07 01:50:26,215 INFO L226 Difference]: Without dead ends: 505 [2021-11-07 01:50:26,215 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:50:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-11-07 01:50:26,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 484. [2021-11-07 01:50:26,267 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-11-07 01:50:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 606 transitions. [2021-11-07 01:50:26,269 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 606 transitions. Word has length 29 [2021-11-07 01:50:26,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:26,270 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 606 transitions. [2021-11-07 01:50:26,270 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-11-07 01:50:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 606 transitions. [2021-11-07 01:50:26,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 01:50:26,272 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:26,272 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:26,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-07 01:50:26,273 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-11-07 01:50:26,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:26,273 INFO L85 PathProgramCache]: Analyzing trace with hash 692479088, now seen corresponding path program 1 times [2021-11-07 01:50:26,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:26,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81915915] [2021-11-07 01:50:26,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:26,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:26,300 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:26,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81915915] [2021-11-07 01:50:26,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81915915] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:26,300 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:26,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:26,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838767526] [2021-11-07 01:50:26,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:50:26,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:26,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:50:26,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:26,302 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-11-07 01:50:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:26,406 INFO L93 Difference]: Finished difference Result 555 states and 686 transitions. [2021-11-07 01:50:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:50:26,407 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-11-07 01:50:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:26,410 INFO L225 Difference]: With dead ends: 555 [2021-11-07 01:50:26,410 INFO L226 Difference]: Without dead ends: 328 [2021-11-07 01:50:26,411 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:26,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-11-07 01:50:26,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 306. [2021-11-07 01:50:26,446 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-11-07 01:50:26,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 365 transitions. [2021-11-07 01:50:26,447 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 365 transitions. Word has length 29 [2021-11-07 01:50:26,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:26,448 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 365 transitions. [2021-11-07 01:50:26,448 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-11-07 01:50:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 365 transitions. [2021-11-07 01:50:26,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 01:50:26,449 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:26,449 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:26,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-07 01:50:26,450 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-11-07 01:50:26,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:26,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1090089878, now seen corresponding path program 1 times [2021-11-07 01:50:26,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:26,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390166895] [2021-11-07 01:50:26,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:26,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:26,530 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:26,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390166895] [2021-11-07 01:50:26,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390166895] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:26,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:26,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 01:50:26,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577387833] [2021-11-07 01:50:26,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 01:50:26,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:26,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 01:50:26,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:50:26,533 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-11-07 01:50:26,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:26,765 INFO L93 Difference]: Finished difference Result 362 states and 423 transitions. [2021-11-07 01:50:26,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:50:26,766 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-11-07 01:50:26,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:26,768 INFO L225 Difference]: With dead ends: 362 [2021-11-07 01:50:26,768 INFO L226 Difference]: Without dead ends: 270 [2021-11-07 01:50:26,768 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:50:26,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-11-07 01:50:26,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 248. [2021-11-07 01:50:26,797 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-11-07 01:50:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 287 transitions. [2021-11-07 01:50:26,798 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 287 transitions. Word has length 29 [2021-11-07 01:50:26,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:26,799 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 287 transitions. [2021-11-07 01:50:26,799 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-11-07 01:50:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 287 transitions. [2021-11-07 01:50:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-07 01:50:26,800 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:26,801 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:26,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-07 01:50:26,801 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-11-07 01:50:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:26,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1241673930, now seen corresponding path program 1 times [2021-11-07 01:50:26,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:26,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542938149] [2021-11-07 01:50:26,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:26,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:26,830 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:26,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542938149] [2021-11-07 01:50:26,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542938149] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:26,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:26,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:26,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230490972] [2021-11-07 01:50:26,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:50:26,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:26,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:50:26,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:26,832 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-11-07 01:50:26,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:26,880 INFO L93 Difference]: Finished difference Result 289 states and 328 transitions. [2021-11-07 01:50:26,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:50:26,881 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-11-07 01:50:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:26,883 INFO L225 Difference]: With dead ends: 289 [2021-11-07 01:50:26,883 INFO L226 Difference]: Without dead ends: 253 [2021-11-07 01:50:26,883 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:26,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-11-07 01:50:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2021-11-07 01:50:26,915 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-11-07 01:50:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 286 transitions. [2021-11-07 01:50:26,917 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 286 transitions. Word has length 32 [2021-11-07 01:50:26,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:26,917 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 286 transitions. [2021-11-07 01:50:26,917 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-11-07 01:50:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions. [2021-11-07 01:50:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-07 01:50:26,918 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:26,919 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:26,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-07 01:50:26,919 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-11-07 01:50:26,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:26,920 INFO L85 PathProgramCache]: Analyzing trace with hash 156718672, now seen corresponding path program 1 times [2021-11-07 01:50:26,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:26,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113089099] [2021-11-07 01:50:26,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:26,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:26,960 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:26,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113089099] [2021-11-07 01:50:26,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113089099] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:26,960 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:26,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:26,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652963386] [2021-11-07 01:50:26,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:50:26,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:26,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:50:26,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:50:26,962 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-11-07 01:50:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:27,083 INFO L93 Difference]: Finished difference Result 257 states and 294 transitions. [2021-11-07 01:50:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:50:27,084 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-11-07 01:50:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:27,086 INFO L225 Difference]: With dead ends: 257 [2021-11-07 01:50:27,086 INFO L226 Difference]: Without dead ends: 240 [2021-11-07 01:50:27,087 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-11-07 01:50:27,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2021-11-07 01:50:27,118 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-11-07 01:50:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 272 transitions. [2021-11-07 01:50:27,119 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 272 transitions. Word has length 34 [2021-11-07 01:50:27,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:27,120 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 272 transitions. [2021-11-07 01:50:27,120 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-11-07 01:50:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 272 transitions. [2021-11-07 01:50:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-07 01:50:27,121 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:27,122 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:27,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-07 01:50:27,122 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-11-07 01:50:27,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:27,123 INFO L85 PathProgramCache]: Analyzing trace with hash -856105982, now seen corresponding path program 1 times [2021-11-07 01:50:27,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:27,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983461992] [2021-11-07 01:50:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:27,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:27,293 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:27,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983461992] [2021-11-07 01:50:27,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983461992] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:27,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:27,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:50:27,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362722168] [2021-11-07 01:50:27,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:50:27,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:27,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:50:27,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:50:27,299 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-11-07 01:50:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:27,461 INFO L93 Difference]: Finished difference Result 259 states and 292 transitions. [2021-11-07 01:50:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:50:27,462 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-11-07 01:50:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:27,464 INFO L225 Difference]: With dead ends: 259 [2021-11-07 01:50:27,464 INFO L226 Difference]: Without dead ends: 212 [2021-11-07 01:50:27,466 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:50:27,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-11-07 01:50:27,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 198. [2021-11-07 01:50:27,501 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-11-07 01:50:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 226 transitions. [2021-11-07 01:50:27,502 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 226 transitions. Word has length 34 [2021-11-07 01:50:27,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:27,504 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 226 transitions. [2021-11-07 01:50:27,505 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-11-07 01:50:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 226 transitions. [2021-11-07 01:50:27,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-07 01:50:27,506 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:27,506 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:27,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-07 01:50:27,509 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-11-07 01:50:27,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:27,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1806263113, now seen corresponding path program 1 times [2021-11-07 01:50:27,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:27,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027485553] [2021-11-07 01:50:27,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:27,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:50:27,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:50:27,572 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:50:27,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027485553] [2021-11-07 01:50:27,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027485553] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:27,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:50:27,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:50:27,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717220076] [2021-11-07 01:50:27,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:50:27,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:27,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:50:27,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:27,574 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-11-07 01:50:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:27,625 INFO L93 Difference]: Finished difference Result 208 states and 236 transitions. [2021-11-07 01:50:27,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:50:27,625 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-11-07 01:50:27,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:27,627 INFO L225 Difference]: With dead ends: 208 [2021-11-07 01:50:27,627 INFO L226 Difference]: Without dead ends: 198 [2021-11-07 01:50:27,628 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:50:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-07 01:50:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-11-07 01:50:27,667 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-11-07 01:50:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 224 transitions. [2021-11-07 01:50:27,669 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 224 transitions. Word has length 34 [2021-11-07 01:50:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:27,669 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 224 transitions. [2021-11-07 01:50:27,669 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-11-07 01:50:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 224 transitions. [2021-11-07 01:50:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 01:50:27,671 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:50:27,671 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:27,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-07 01:50:27,672 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-11-07 01:50:27,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:50:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash -829704437, now seen corresponding path program 1 times [2021-11-07 01:50:27,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:50:27,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506317249] [2021-11-07 01:50:27,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:50:27,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:50:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:50:27,713 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:50:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:50:27,815 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:50:27,816 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:50:27,817 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,825 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,825 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,825 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,825 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,826 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,826 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,826 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,827 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,827 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,827 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,827 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,828 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,828 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,828 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,828 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,829 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,829 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,829 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,830 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,830 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,830 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,830 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,831 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,831 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,831 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,831 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,832 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,832 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,832 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,833 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,833 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,833 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,833 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,834 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,834 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,834 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,834 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,835 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,835 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,835 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,835 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,836 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,836 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,836 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,838 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,838 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,838 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,838 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,839 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,839 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:27,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-07 01:50:27,853 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:27,859 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:50:28,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:50:28 BoogieIcfgContainer [2021-11-07 01:50:28,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:50:28,026 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:50:28,026 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:50:28,026 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:50:28,027 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:50:11" (3/4) ... [2021-11-07 01:50:28,030 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 01:50:28,181 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:50:28,182 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:50:28,184 INFO L168 Benchmark]: Toolchain (without parser) took 24211.11 ms. Allocated memory was 115.3 MB in the beginning and 545.3 MB in the end (delta: 429.9 MB). Free memory was 79.5 MB in the beginning and 425.7 MB in the end (delta: -346.2 MB). Peak memory consumption was 83.0 MB. Max. memory is 16.1 GB. [2021-11-07 01:50:28,184 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 86.0 MB. Free memory was 57.3 MB in the beginning and 57.3 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:50:28,185 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.84 ms. Allocated memory is still 115.3 MB. Free memory was 79.5 MB in the beginning and 72.6 MB in the end (delta: 6.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 01:50:28,186 INFO L168 Benchmark]: Boogie Procedure Inliner took 231.33 ms. Allocated memory is still 115.3 MB. Free memory was 72.4 MB in the beginning and 52.3 MB in the end (delta: 20.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-11-07 01:50:28,186 INFO L168 Benchmark]: Boogie Preprocessor took 175.87 ms. Allocated memory is still 115.3 MB. Free memory was 52.3 MB in the beginning and 39.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 01:50:28,187 INFO L168 Benchmark]: RCFGBuilder took 6049.73 ms. Allocated memory was 115.3 MB in the beginning and 262.1 MB in the end (delta: 146.8 MB). Free memory was 39.7 MB in the beginning and 170.9 MB in the end (delta: -131.3 MB). Peak memory consumption was 103.8 MB. Max. memory is 16.1 GB. [2021-11-07 01:50:28,193 INFO L168 Benchmark]: TraceAbstraction took 16737.94 ms. Allocated memory was 262.1 MB in the beginning and 545.3 MB in the end (delta: 283.1 MB). Free memory was 169.9 MB in the beginning and 436.2 MB in the end (delta: -266.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-11-07 01:50:28,194 INFO L168 Benchmark]: Witness Printer took 155.86 ms. Allocated memory is still 545.3 MB. Free memory was 436.2 MB in the beginning and 425.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:50:28,196 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.33 ms. Allocated memory is still 86.0 MB. Free memory was 57.3 MB in the beginning and 57.3 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 849.84 ms. Allocated memory is still 115.3 MB. Free memory was 79.5 MB in the beginning and 72.6 MB in the end (delta: 6.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 231.33 ms. Allocated memory is still 115.3 MB. Free memory was 72.4 MB in the beginning and 52.3 MB in the end (delta: 20.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 175.87 ms. Allocated memory is still 115.3 MB. Free memory was 52.3 MB in the beginning and 39.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 6049.73 ms. Allocated memory was 115.3 MB in the beginning and 262.1 MB in the end (delta: 146.8 MB). Free memory was 39.7 MB in the beginning and 170.9 MB in the end (delta: -131.3 MB). Peak memory consumption was 103.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16737.94 ms. Allocated memory was 262.1 MB in the beginning and 545.3 MB in the end (delta: 283.1 MB). Free memory was 169.9 MB in the beginning and 436.2 MB in the end (delta: -266.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Witness Printer took 155.86 ms. Allocated memory is still 545.3 MB. Free memory was 436.2 MB in the beginning and 425.7 MB in the end (delta: 10.5 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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: 16.5s, OverallIterations: 45, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 25841 SDtfs, 12280 SDslu, 43843 SDs, 0 SdLazy, 5346 SolverSat, 764 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 44 MinimizatonAttempts, 1017 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s 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-11-07 01:50:28,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7794a121-6a8c-4287-aaca-a5136724d250/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE