./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac65b92526cdafd793de45207c8e0f67883c86dc6af3548ef3333097912e0ee4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:24:13,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:24:13,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:24:13,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:24:13,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:24:13,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:24:13,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:24:13,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:24:13,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:24:13,461 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:24:13,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:24:13,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:24:13,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:24:13,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:24:13,462 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:24:13,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:24:13,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:24:13,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:24:13,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:24:13,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:24:13,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:24:13,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:24:13,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:24:13,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:24:13,468 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:24:13,468 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:24:13,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:24:13,469 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:24:13,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:24:13,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:24:13,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:24:13,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:24:13,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:24:13,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:24:13,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:24:13,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:24:13,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:24:13,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:24:13,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:24:13,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:24:13,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:24:13,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:24:13,474 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Automizer 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 -> ac65b92526cdafd793de45207c8e0f67883c86dc6af3548ef3333097912e0ee4 [2024-10-12 20:24:13,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:24:13,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:24:13,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:24:13,721 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:24:13,722 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:24:13,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-12 20:24:15,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:24:15,549 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:24:15,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-12 20:24:15,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c24e91fb/e7469a60e7244e94838f5f9ce27b71d9/FLAGec313dc4e [2024-10-12 20:24:15,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c24e91fb/e7469a60e7244e94838f5f9ce27b71d9 [2024-10-12 20:24:15,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:24:15,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:24:15,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:24:15,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:24:15,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:24:15,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:24:15" (1/1) ... [2024-10-12 20:24:15,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a767e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:15, skipping insertion in model container [2024-10-12 20:24:15,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:24:15" (1/1) ... [2024-10-12 20:24:15,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:24:16,123 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13606,13619] [2024-10-12 20:24:16,152 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19227,19240] [2024-10-12 20:24:16,159 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20416,20429] [2024-10-12 20:24:16,167 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22562,22575] [2024-10-12 20:24:16,178 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25842,25855] [2024-10-12 20:24:16,195 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[32130,32143] [2024-10-12 20:24:16,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:24:16,607 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:24:16,654 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13606,13619] [2024-10-12 20:24:16,662 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19227,19240] [2024-10-12 20:24:16,665 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20416,20429] [2024-10-12 20:24:16,669 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22562,22575] [2024-10-12 20:24:16,676 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25842,25855] [2024-10-12 20:24:16,686 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[32130,32143] [2024-10-12 20:24:16,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:24:16,977 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:24:16,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:16 WrapperNode [2024-10-12 20:24:16,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:24:16,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:24:16,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:24:16,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:24:16,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:16" (1/1) ... [2024-10-12 20:24:17,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:16" (1/1) ... [2024-10-12 20:24:17,151 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9476 [2024-10-12 20:24:17,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:24:17,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:24:17,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:24:17,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:24:17,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:16" (1/1) ... [2024-10-12 20:24:17,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:16" (1/1) ... [2024-10-12 20:24:17,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:16" (1/1) ... [2024-10-12 20:24:17,243 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:24:17,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:16" (1/1) ... [2024-10-12 20:24:17,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:16" (1/1) ... [2024-10-12 20:24:17,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:16" (1/1) ... [2024-10-12 20:24:17,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:16" (1/1) ... [2024-10-12 20:24:17,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:16" (1/1) ... [2024-10-12 20:24:17,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:16" (1/1) ... [2024-10-12 20:24:17,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:24:17,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:24:17,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:24:17,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:24:17,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:16" (1/1) ... [2024-10-12 20:24:17,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:24:17,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:24:17,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:24:17,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:24:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:24:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:24:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:24:17,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:24:17,928 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:24:17,930 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:24:21,791 INFO L? ?]: Removed 1319 outVars from TransFormulas that were not future-live. [2024-10-12 20:24:21,791 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:24:21,887 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:24:21,888 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:24:21,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:24:21 BoogieIcfgContainer [2024-10-12 20:24:21,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:24:21,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:24:21,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:24:21,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:24:21,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:24:15" (1/3) ... [2024-10-12 20:24:21,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6037277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:24:21, skipping insertion in model container [2024-10-12 20:24:21,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:24:16" (2/3) ... [2024-10-12 20:24:21,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6037277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:24:21, skipping insertion in model container [2024-10-12 20:24:21,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:24:21" (3/3) ... [2024-10-12 20:24:21,953 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-12 20:24:21,967 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:24:21,967 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-12 20:24:22,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:24:22,075 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59937ac9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:24:22,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-12 20:24:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 1749 states, 1742 states have (on average 1.801377726750861) internal successors, (3138), 1748 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:24:22,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:22,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:22,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:22,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:22,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2058921044, now seen corresponding path program 1 times [2024-10-12 20:24:22,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:22,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786658917] [2024-10-12 20:24:22,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:22,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:22,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:22,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786658917] [2024-10-12 20:24:22,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786658917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:22,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:22,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:24:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504466780] [2024-10-12 20:24:22,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:22,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:24:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:22,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:24:22,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:24:22,676 INFO L87 Difference]: Start difference. First operand has 1749 states, 1742 states have (on average 1.801377726750861) internal successors, (3138), 1748 states have internal predecessors, (3138), 0 states have call successors, (0), 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 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:23,025 INFO L93 Difference]: Finished difference Result 2508 states and 4416 transitions. [2024-10-12 20:24:23,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:24:23,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-12 20:24:23,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:23,054 INFO L225 Difference]: With dead ends: 2508 [2024-10-12 20:24:23,054 INFO L226 Difference]: Without dead ends: 2314 [2024-10-12 20:24:23,059 INFO L431 NwaCegarLoop]: 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 [2024-10-12 20:24:23,063 INFO L432 NwaCegarLoop]: 3617 mSDtfsCounter, 1877 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1877 SdHoareTripleChecker+Valid, 5623 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:23,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1877 Valid, 5623 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:24:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2024-10-12 20:24:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2304. [2024-10-12 20:24:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2304 states, 2298 states have (on average 1.3059181897302001) internal successors, (3001), 2303 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3001 transitions. [2024-10-12 20:24:23,167 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3001 transitions. Word has length 74 [2024-10-12 20:24:23,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:23,168 INFO L471 AbstractCegarLoop]: Abstraction has 2304 states and 3001 transitions. [2024-10-12 20:24:23,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3001 transitions. [2024-10-12 20:24:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:24:23,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:23,172 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:23,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:24:23,173 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:23,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1495234726, now seen corresponding path program 1 times [2024-10-12 20:24:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:23,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13449790] [2024-10-12 20:24:23,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:23,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:23,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:23,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13449790] [2024-10-12 20:24:23,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13449790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:23,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:23,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:24:23,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012669322] [2024-10-12 20:24:23,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:23,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:24:23,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:23,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:24:23,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:24:23,315 INFO L87 Difference]: Start difference. First operand 2304 states and 3001 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:23,442 INFO L93 Difference]: Finished difference Result 3217 states and 4350 transitions. [2024-10-12 20:24:23,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:24:23,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-12 20:24:23,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:23,450 INFO L225 Difference]: With dead ends: 3217 [2024-10-12 20:24:23,451 INFO L226 Difference]: Without dead ends: 2758 [2024-10-12 20:24:23,452 INFO L431 NwaCegarLoop]: 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 [2024-10-12 20:24:23,453 INFO L432 NwaCegarLoop]: 2343 mSDtfsCounter, 1183 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 3766 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:23,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 3766 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:24:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2024-10-12 20:24:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2748. [2024-10-12 20:24:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2748 states, 2742 states have (on average 1.3315098468271336) internal successors, (3651), 2747 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2748 states and 3651 transitions. [2024-10-12 20:24:23,499 INFO L78 Accepts]: Start accepts. Automaton has 2748 states and 3651 transitions. Word has length 74 [2024-10-12 20:24:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:23,500 INFO L471 AbstractCegarLoop]: Abstraction has 2748 states and 3651 transitions. [2024-10-12 20:24:23,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3651 transitions. [2024-10-12 20:24:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:24:23,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:23,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:23,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:24:23,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:23,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash 209016782, now seen corresponding path program 1 times [2024-10-12 20:24:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:23,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048177125] [2024-10-12 20:24:23,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:23,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:23,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:23,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048177125] [2024-10-12 20:24:23,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048177125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:23,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:23,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:23,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071689262] [2024-10-12 20:24:23,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:23,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:24:23,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:23,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:24:23,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:24:23,686 INFO L87 Difference]: Start difference. First operand 2748 states and 3651 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:24,446 INFO L93 Difference]: Finished difference Result 5031 states and 6902 transitions. [2024-10-12 20:24:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:24:24,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-12 20:24:24,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:24,454 INFO L225 Difference]: With dead ends: 5031 [2024-10-12 20:24:24,454 INFO L226 Difference]: Without dead ends: 2884 [2024-10-12 20:24:24,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:24,457 INFO L432 NwaCegarLoop]: 991 mSDtfsCounter, 5807 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5807 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:24,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5807 Valid, 1209 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:24:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2024-10-12 20:24:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 2874. [2024-10-12 20:24:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2874 states, 2868 states have (on average 1.3852859135285913) internal successors, (3973), 2873 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 3973 transitions. [2024-10-12 20:24:24,496 INFO L78 Accepts]: Start accepts. Automaton has 2874 states and 3973 transitions. Word has length 74 [2024-10-12 20:24:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:24,496 INFO L471 AbstractCegarLoop]: Abstraction has 2874 states and 3973 transitions. [2024-10-12 20:24:24,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 3973 transitions. [2024-10-12 20:24:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:24:24,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:24,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:24,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:24:24,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:24,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:24,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2036024049, now seen corresponding path program 1 times [2024-10-12 20:24:24,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:24,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658636245] [2024-10-12 20:24:24,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:24,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:24,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:24,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658636245] [2024-10-12 20:24:24,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658636245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:24,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:24,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:24,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389872861] [2024-10-12 20:24:24,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:24,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:24:24,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:24,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:24:24,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:24:24,729 INFO L87 Difference]: Start difference. First operand 2874 states and 3973 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:25,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:25,753 INFO L93 Difference]: Finished difference Result 6084 states and 8641 transitions. [2024-10-12 20:24:25,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:24:25,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-12 20:24:25,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:25,763 INFO L225 Difference]: With dead ends: 6084 [2024-10-12 20:24:25,763 INFO L226 Difference]: Without dead ends: 3651 [2024-10-12 20:24:25,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:25,767 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 4627 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4627 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:25,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4627 Valid, 988 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 20:24:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2024-10-12 20:24:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 3641. [2024-10-12 20:24:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3641 states, 3635 states have (on average 1.4255845942228336) internal successors, (5182), 3640 states have internal predecessors, (5182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 5182 transitions. [2024-10-12 20:24:25,813 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 5182 transitions. Word has length 75 [2024-10-12 20:24:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:25,814 INFO L471 AbstractCegarLoop]: Abstraction has 3641 states and 5182 transitions. [2024-10-12 20:24:25,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 5182 transitions. [2024-10-12 20:24:25,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:24:25,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:25,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:25,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:24:25,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:25,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:25,818 INFO L85 PathProgramCache]: Analyzing trace with hash -673249547, now seen corresponding path program 1 times [2024-10-12 20:24:25,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:25,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252886909] [2024-10-12 20:24:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:25,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:25,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:25,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252886909] [2024-10-12 20:24:25,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252886909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:25,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:25,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:24:25,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703010558] [2024-10-12 20:24:25,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:25,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:24:25,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:25,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:24:25,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:24:25,895 INFO L87 Difference]: Start difference. First operand 3641 states and 5182 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:25,953 INFO L93 Difference]: Finished difference Result 7379 states and 10650 transitions. [2024-10-12 20:24:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:24:25,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-12 20:24:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:25,965 INFO L225 Difference]: With dead ends: 7379 [2024-10-12 20:24:25,965 INFO L226 Difference]: Without dead ends: 5162 [2024-10-12 20:24:25,968 INFO L431 NwaCegarLoop]: 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 [2024-10-12 20:24:25,969 INFO L432 NwaCegarLoop]: 1760 mSDtfsCounter, 1094 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:25,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 2700 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:24:25,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5162 states. [2024-10-12 20:24:26,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5162 to 5144. [2024-10-12 20:24:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5144 states, 5138 states have (on average 1.4135850525496303) internal successors, (7263), 5143 states have internal predecessors, (7263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5144 states to 5144 states and 7263 transitions. [2024-10-12 20:24:26,035 INFO L78 Accepts]: Start accepts. Automaton has 5144 states and 7263 transitions. Word has length 76 [2024-10-12 20:24:26,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:26,036 INFO L471 AbstractCegarLoop]: Abstraction has 5144 states and 7263 transitions. [2024-10-12 20:24:26,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 5144 states and 7263 transitions. [2024-10-12 20:24:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:24:26,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:26,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:26,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:24:26,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:26,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:26,049 INFO L85 PathProgramCache]: Analyzing trace with hash -560510585, now seen corresponding path program 1 times [2024-10-12 20:24:26,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:26,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102657051] [2024-10-12 20:24:26,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:26,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:26,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:26,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102657051] [2024-10-12 20:24:26,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102657051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:26,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:26,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:24:26,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465796204] [2024-10-12 20:24:26,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:26,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:24:26,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:26,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:24:26,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:24:26,183 INFO L87 Difference]: Start difference. First operand 5144 states and 7263 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:26,256 INFO L93 Difference]: Finished difference Result 10415 states and 14894 transitions. [2024-10-12 20:24:26,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:24:26,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-12 20:24:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:26,281 INFO L225 Difference]: With dead ends: 10415 [2024-10-12 20:24:26,282 INFO L226 Difference]: Without dead ends: 7234 [2024-10-12 20:24:26,286 INFO L431 NwaCegarLoop]: 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 [2024-10-12 20:24:26,287 INFO L432 NwaCegarLoop]: 1773 mSDtfsCounter, 1112 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:26,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 2708 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:24:26,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7234 states. [2024-10-12 20:24:26,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7234 to 7212. [2024-10-12 20:24:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7212 states, 7206 states have (on average 1.4014709963918957) internal successors, (10099), 7211 states have internal predecessors, (10099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7212 states to 7212 states and 10099 transitions. [2024-10-12 20:24:26,392 INFO L78 Accepts]: Start accepts. Automaton has 7212 states and 10099 transitions. Word has length 76 [2024-10-12 20:24:26,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:26,392 INFO L471 AbstractCegarLoop]: Abstraction has 7212 states and 10099 transitions. [2024-10-12 20:24:26,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 7212 states and 10099 transitions. [2024-10-12 20:24:26,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:24:26,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:26,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:26,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:24:26,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:26,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:26,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1192523870, now seen corresponding path program 1 times [2024-10-12 20:24:26,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:26,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854031939] [2024-10-12 20:24:26,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:26,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:26,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:26,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854031939] [2024-10-12 20:24:26,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854031939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:26,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:26,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:24:26,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542304916] [2024-10-12 20:24:26,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:26,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:24:26,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:26,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:24:26,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:24:26,576 INFO L87 Difference]: Start difference. First operand 7212 states and 10099 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:26,640 INFO L93 Difference]: Finished difference Result 16567 states and 23714 transitions. [2024-10-12 20:24:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:24:26,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-12 20:24:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:26,674 INFO L225 Difference]: With dead ends: 16567 [2024-10-12 20:24:26,678 INFO L226 Difference]: Without dead ends: 11138 [2024-10-12 20:24:26,690 INFO L431 NwaCegarLoop]: 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 [2024-10-12 20:24:26,698 INFO L432 NwaCegarLoop]: 1382 mSDtfsCounter, 716 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:26,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 2328 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:24:26,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2024-10-12 20:24:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 11128. [2024-10-12 20:24:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11128 states, 11122 states have (on average 1.4129652940118684) internal successors, (15715), 11127 states have internal predecessors, (15715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11128 states to 11128 states and 15715 transitions. [2024-10-12 20:24:26,837 INFO L78 Accepts]: Start accepts. Automaton has 11128 states and 15715 transitions. Word has length 76 [2024-10-12 20:24:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:26,837 INFO L471 AbstractCegarLoop]: Abstraction has 11128 states and 15715 transitions. [2024-10-12 20:24:26,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 11128 states and 15715 transitions. [2024-10-12 20:24:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:24:26,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:26,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:26,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:24:26,846 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:26,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:26,846 INFO L85 PathProgramCache]: Analyzing trace with hash -533704172, now seen corresponding path program 1 times [2024-10-12 20:24:26,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:26,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244862871] [2024-10-12 20:24:26,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:26,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:26,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:26,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244862871] [2024-10-12 20:24:26,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244862871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:26,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:26,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:26,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178749001] [2024-10-12 20:24:26,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:26,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:24:26,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:26,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:24:26,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:24:26,976 INFO L87 Difference]: Start difference. First operand 11128 states and 15715 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:27,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:27,566 INFO L93 Difference]: Finished difference Result 24319 states and 34640 transitions. [2024-10-12 20:24:27,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:24:27,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-12 20:24:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:27,588 INFO L225 Difference]: With dead ends: 24319 [2024-10-12 20:24:27,588 INFO L226 Difference]: Without dead ends: 14156 [2024-10-12 20:24:27,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:27,601 INFO L432 NwaCegarLoop]: 664 mSDtfsCounter, 3965 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3965 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:27,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3965 Valid, 859 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:24:27,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14156 states. [2024-10-12 20:24:27,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14156 to 14110. [2024-10-12 20:24:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14110 states, 14104 states have (on average 1.41626488939308) internal successors, (19975), 14109 states have internal predecessors, (19975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14110 states to 14110 states and 19975 transitions. [2024-10-12 20:24:27,855 INFO L78 Accepts]: Start accepts. Automaton has 14110 states and 19975 transitions. Word has length 76 [2024-10-12 20:24:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:27,856 INFO L471 AbstractCegarLoop]: Abstraction has 14110 states and 19975 transitions. [2024-10-12 20:24:27,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 14110 states and 19975 transitions. [2024-10-12 20:24:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:24:27,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:27,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:27,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:24:27,866 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:27,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:27,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1266054146, now seen corresponding path program 1 times [2024-10-12 20:24:27,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:27,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12781023] [2024-10-12 20:24:27,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:27,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:28,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:28,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12781023] [2024-10-12 20:24:28,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12781023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:28,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:28,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:24:28,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651933778] [2024-10-12 20:24:28,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:28,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:24:28,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:28,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:24:28,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:28,095 INFO L87 Difference]: Start difference. First operand 14110 states and 19975 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:29,008 INFO L93 Difference]: Finished difference Result 29930 states and 42979 transitions. [2024-10-12 20:24:29,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:24:29,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-12 20:24:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:29,047 INFO L225 Difference]: With dead ends: 29930 [2024-10-12 20:24:29,047 INFO L226 Difference]: Without dead ends: 25586 [2024-10-12 20:24:29,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:24:29,060 INFO L432 NwaCegarLoop]: 685 mSDtfsCounter, 5181 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5181 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:29,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5181 Valid, 1755 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:24:29,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25586 states. [2024-10-12 20:24:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25586 to 14158. [2024-10-12 20:24:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14158 states, 14152 states have (on average 1.415983606557377) internal successors, (20039), 14157 states have internal predecessors, (20039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14158 states to 14158 states and 20039 transitions. [2024-10-12 20:24:29,372 INFO L78 Accepts]: Start accepts. Automaton has 14158 states and 20039 transitions. Word has length 77 [2024-10-12 20:24:29,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:29,372 INFO L471 AbstractCegarLoop]: Abstraction has 14158 states and 20039 transitions. [2024-10-12 20:24:29,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:29,373 INFO L276 IsEmpty]: Start isEmpty. Operand 14158 states and 20039 transitions. [2024-10-12 20:24:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:24:29,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:29,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:29,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:24:29,382 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:29,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:29,385 INFO L85 PathProgramCache]: Analyzing trace with hash 433382606, now seen corresponding path program 1 times [2024-10-12 20:24:29,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:29,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193447007] [2024-10-12 20:24:29,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:29,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:29,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:29,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193447007] [2024-10-12 20:24:29,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193447007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:29,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:29,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:24:29,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71269866] [2024-10-12 20:24:29,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:29,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:24:29,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:29,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:24:29,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:29,575 INFO L87 Difference]: Start difference. First operand 14158 states and 20039 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:30,499 INFO L93 Difference]: Finished difference Result 34906 states and 50276 transitions. [2024-10-12 20:24:30,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:24:30,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-12 20:24:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:30,691 INFO L225 Difference]: With dead ends: 34906 [2024-10-12 20:24:30,691 INFO L226 Difference]: Without dead ends: 29286 [2024-10-12 20:24:30,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:24:30,698 INFO L432 NwaCegarLoop]: 674 mSDtfsCounter, 5081 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5081 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:30,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5081 Valid, 1724 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:24:30,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29286 states. [2024-10-12 20:24:30,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29286 to 14338. [2024-10-12 20:24:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14338 states, 14332 states have (on average 1.4149455763326821) internal successors, (20279), 14337 states have internal predecessors, (20279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14338 states to 14338 states and 20279 transitions. [2024-10-12 20:24:30,956 INFO L78 Accepts]: Start accepts. Automaton has 14338 states and 20279 transitions. Word has length 77 [2024-10-12 20:24:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:30,956 INFO L471 AbstractCegarLoop]: Abstraction has 14338 states and 20279 transitions. [2024-10-12 20:24:30,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 14338 states and 20279 transitions. [2024-10-12 20:24:30,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:24:30,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:30,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:30,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:24:30,966 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:30,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:30,966 INFO L85 PathProgramCache]: Analyzing trace with hash -421429613, now seen corresponding path program 1 times [2024-10-12 20:24:30,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:30,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051609879] [2024-10-12 20:24:30,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:30,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:31,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:31,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051609879] [2024-10-12 20:24:31,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051609879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:31,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:31,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:24:31,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426304415] [2024-10-12 20:24:31,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:31,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:24:31,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:31,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:24:31,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:31,126 INFO L87 Difference]: Start difference. First operand 14338 states and 20279 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:32,004 INFO L93 Difference]: Finished difference Result 32592 states and 46875 transitions. [2024-10-12 20:24:32,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:24:32,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-12 20:24:32,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:32,034 INFO L225 Difference]: With dead ends: 32592 [2024-10-12 20:24:32,035 INFO L226 Difference]: Without dead ends: 27258 [2024-10-12 20:24:32,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:24:32,048 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 5036 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5036 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:32,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5036 Valid, 1699 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:24:32,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27258 states. [2024-10-12 20:24:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27258 to 14638. [2024-10-12 20:24:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14638 states, 14632 states have (on average 1.4135456533624933) internal successors, (20683), 14637 states have internal predecessors, (20683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14638 states to 14638 states and 20683 transitions. [2024-10-12 20:24:32,398 INFO L78 Accepts]: Start accepts. Automaton has 14638 states and 20683 transitions. Word has length 77 [2024-10-12 20:24:32,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:32,398 INFO L471 AbstractCegarLoop]: Abstraction has 14638 states and 20683 transitions. [2024-10-12 20:24:32,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 14638 states and 20683 transitions. [2024-10-12 20:24:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 20:24:32,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:32,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:32,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:24:32,407 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:32,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash -527964228, now seen corresponding path program 1 times [2024-10-12 20:24:32,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:32,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15539958] [2024-10-12 20:24:32,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:32,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:32,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:32,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15539958] [2024-10-12 20:24:32,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15539958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:32,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:32,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:32,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497571522] [2024-10-12 20:24:32,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:32,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:24:32,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:32,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:24:32,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:24:32,671 INFO L87 Difference]: Start difference. First operand 14638 states and 20683 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:32,716 INFO L93 Difference]: Finished difference Result 14638 states and 20683 transitions. [2024-10-12 20:24:32,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:24:32,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-12 20:24:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:32,731 INFO L225 Difference]: With dead ends: 14638 [2024-10-12 20:24:32,732 INFO L226 Difference]: Without dead ends: 14636 [2024-10-12 20:24:32,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:24:32,738 INFO L432 NwaCegarLoop]: 1175 mSDtfsCounter, 0 mSDsluCounter, 2348 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3523 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:32,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3523 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:24:32,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14636 states. [2024-10-12 20:24:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14636 to 14636. [2024-10-12 20:24:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14636 states, 14631 states have (on average 1.4111133893787164) internal successors, (20646), 14635 states have internal predecessors, (20646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14636 states to 14636 states and 20646 transitions. [2024-10-12 20:24:32,892 INFO L78 Accepts]: Start accepts. Automaton has 14636 states and 20646 transitions. Word has length 78 [2024-10-12 20:24:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:32,892 INFO L471 AbstractCegarLoop]: Abstraction has 14636 states and 20646 transitions. [2024-10-12 20:24:32,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 14636 states and 20646 transitions. [2024-10-12 20:24:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 20:24:32,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:32,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:32,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:24:32,903 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:32,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:32,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1000233041, now seen corresponding path program 1 times [2024-10-12 20:24:32,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:32,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390554935] [2024-10-12 20:24:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:32,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:33,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:33,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390554935] [2024-10-12 20:24:33,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390554935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:33,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:33,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:33,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867104627] [2024-10-12 20:24:33,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:33,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:24:33,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:33,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:24:33,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:24:33,150 INFO L87 Difference]: Start difference. First operand 14636 states and 20646 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:33,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:33,194 INFO L93 Difference]: Finished difference Result 14636 states and 20646 transitions. [2024-10-12 20:24:33,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:24:33,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-12 20:24:33,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:33,209 INFO L225 Difference]: With dead ends: 14636 [2024-10-12 20:24:33,210 INFO L226 Difference]: Without dead ends: 14634 [2024-10-12 20:24:33,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:24:33,216 INFO L432 NwaCegarLoop]: 1173 mSDtfsCounter, 0 mSDsluCounter, 2344 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3517 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:33,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3517 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:24:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14634 states. [2024-10-12 20:24:33,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14634 to 14634. [2024-10-12 20:24:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14634 states, 14630 states have (on average 1.4086807928913192) internal successors, (20609), 14633 states have internal predecessors, (20609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14634 states to 14634 states and 20609 transitions. [2024-10-12 20:24:33,491 INFO L78 Accepts]: Start accepts. Automaton has 14634 states and 20609 transitions. Word has length 78 [2024-10-12 20:24:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:33,491 INFO L471 AbstractCegarLoop]: Abstraction has 14634 states and 20609 transitions. [2024-10-12 20:24:33,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 14634 states and 20609 transitions. [2024-10-12 20:24:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 20:24:33,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:33,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:33,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:24:33,501 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:33,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:33,501 INFO L85 PathProgramCache]: Analyzing trace with hash -559253753, now seen corresponding path program 1 times [2024-10-12 20:24:33,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:33,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451120515] [2024-10-12 20:24:33,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:33,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:33,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:33,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451120515] [2024-10-12 20:24:33,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451120515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:33,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:33,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:33,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20772285] [2024-10-12 20:24:33,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:33,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:24:33,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:33,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:24:33,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:24:33,596 INFO L87 Difference]: Start difference. First operand 14634 states and 20609 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:34,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:34,386 INFO L93 Difference]: Finished difference Result 32707 states and 46103 transitions. [2024-10-12 20:24:34,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:24:34,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-12 20:24:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:34,404 INFO L225 Difference]: With dead ends: 32707 [2024-10-12 20:24:34,404 INFO L226 Difference]: Without dead ends: 18876 [2024-10-12 20:24:34,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:34,418 INFO L432 NwaCegarLoop]: 618 mSDtfsCounter, 3599 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3599 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:34,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3599 Valid, 768 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:24:34,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18876 states. [2024-10-12 20:24:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18876 to 18816. [2024-10-12 20:24:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18816 states, 18812 states have (on average 1.3977248564745908) internal successors, (26294), 18815 states have internal predecessors, (26294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18816 states to 18816 states and 26294 transitions. [2024-10-12 20:24:34,597 INFO L78 Accepts]: Start accepts. Automaton has 18816 states and 26294 transitions. Word has length 78 [2024-10-12 20:24:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:34,597 INFO L471 AbstractCegarLoop]: Abstraction has 18816 states and 26294 transitions. [2024-10-12 20:24:34,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 18816 states and 26294 transitions. [2024-10-12 20:24:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 20:24:34,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:34,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:34,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:24:34,608 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:34,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:34,609 INFO L85 PathProgramCache]: Analyzing trace with hash -337684182, now seen corresponding path program 1 times [2024-10-12 20:24:34,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:34,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939991256] [2024-10-12 20:24:34,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:34,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:34,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:34,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939991256] [2024-10-12 20:24:34,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939991256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:34,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:34,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:34,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947611135] [2024-10-12 20:24:34,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:34,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:24:34,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:34,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:24:34,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:24:34,696 INFO L87 Difference]: Start difference. First operand 18816 states and 26294 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:35,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:35,224 INFO L93 Difference]: Finished difference Result 43749 states and 61398 transitions. [2024-10-12 20:24:35,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:24:35,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-12 20:24:35,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:35,253 INFO L225 Difference]: With dead ends: 43749 [2024-10-12 20:24:35,253 INFO L226 Difference]: Without dead ends: 25803 [2024-10-12 20:24:35,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:35,273 INFO L432 NwaCegarLoop]: 692 mSDtfsCounter, 3975 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3975 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:35,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3975 Valid, 902 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:24:35,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25803 states. [2024-10-12 20:24:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25803 to 18816. [2024-10-12 20:24:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18816 states, 18812 states have (on average 1.3933659366361897) internal successors, (26212), 18815 states have internal predecessors, (26212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18816 states to 18816 states and 26212 transitions. [2024-10-12 20:24:35,624 INFO L78 Accepts]: Start accepts. Automaton has 18816 states and 26212 transitions. Word has length 78 [2024-10-12 20:24:35,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:35,624 INFO L471 AbstractCegarLoop]: Abstraction has 18816 states and 26212 transitions. [2024-10-12 20:24:35,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 18816 states and 26212 transitions. [2024-10-12 20:24:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:24:35,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:35,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:35,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:24:35,634 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:35,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:35,635 INFO L85 PathProgramCache]: Analyzing trace with hash -184549286, now seen corresponding path program 1 times [2024-10-12 20:24:35,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:35,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140828922] [2024-10-12 20:24:35,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:35,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:35,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:35,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140828922] [2024-10-12 20:24:35,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140828922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:35,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:35,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:24:35,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878256896] [2024-10-12 20:24:35,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:35,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:24:35,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:35,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:24:35,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:35,779 INFO L87 Difference]: Start difference. First operand 18816 states and 26212 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:36,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:36,773 INFO L93 Difference]: Finished difference Result 41940 states and 59218 transitions. [2024-10-12 20:24:36,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:24:36,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-12 20:24:36,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:36,814 INFO L225 Difference]: With dead ends: 41940 [2024-10-12 20:24:36,815 INFO L226 Difference]: Without dead ends: 34466 [2024-10-12 20:24:36,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:24:36,833 INFO L432 NwaCegarLoop]: 619 mSDtfsCounter, 4771 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4771 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:36,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4771 Valid, 1671 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:24:36,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34466 states. [2024-10-12 20:24:37,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34466 to 19323. [2024-10-12 20:24:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19323 states, 19319 states have (on average 1.3923080904808738) internal successors, (26898), 19322 states have internal predecessors, (26898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19323 states to 19323 states and 26898 transitions. [2024-10-12 20:24:37,310 INFO L78 Accepts]: Start accepts. Automaton has 19323 states and 26898 transitions. Word has length 79 [2024-10-12 20:24:37,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:37,310 INFO L471 AbstractCegarLoop]: Abstraction has 19323 states and 26898 transitions. [2024-10-12 20:24:37,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 19323 states and 26898 transitions. [2024-10-12 20:24:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:24:37,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:37,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:37,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:24:37,320 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:37,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:37,321 INFO L85 PathProgramCache]: Analyzing trace with hash -454273550, now seen corresponding path program 1 times [2024-10-12 20:24:37,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:37,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092263531] [2024-10-12 20:24:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:37,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:37,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:37,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092263531] [2024-10-12 20:24:37,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092263531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:37,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:37,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:24:37,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522476719] [2024-10-12 20:24:37,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:37,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:24:37,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:37,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:24:37,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:37,473 INFO L87 Difference]: Start difference. First operand 19323 states and 26898 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:38,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:38,359 INFO L93 Difference]: Finished difference Result 39249 states and 55219 transitions. [2024-10-12 20:24:38,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:24:38,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-12 20:24:38,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:38,395 INFO L225 Difference]: With dead ends: 39249 [2024-10-12 20:24:38,395 INFO L226 Difference]: Without dead ends: 30107 [2024-10-12 20:24:38,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:24:38,410 INFO L432 NwaCegarLoop]: 689 mSDtfsCounter, 4574 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4574 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:38,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4574 Valid, 1591 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:24:38,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30107 states. [2024-10-12 20:24:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30107 to 19407. [2024-10-12 20:24:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19407 states, 19403 states have (on average 1.391846621656445) internal successors, (27006), 19406 states have internal predecessors, (27006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19407 states to 19407 states and 27006 transitions. [2024-10-12 20:24:38,805 INFO L78 Accepts]: Start accepts. Automaton has 19407 states and 27006 transitions. Word has length 79 [2024-10-12 20:24:38,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:38,806 INFO L471 AbstractCegarLoop]: Abstraction has 19407 states and 27006 transitions. [2024-10-12 20:24:38,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 19407 states and 27006 transitions. [2024-10-12 20:24:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 20:24:38,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:38,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:38,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:24:38,814 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:38,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:38,814 INFO L85 PathProgramCache]: Analyzing trace with hash 952801472, now seen corresponding path program 1 times [2024-10-12 20:24:38,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:38,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811130427] [2024-10-12 20:24:38,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:38,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:38,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:38,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811130427] [2024-10-12 20:24:38,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811130427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:38,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:38,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:38,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691704689] [2024-10-12 20:24:38,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:38,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:24:38,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:38,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:24:38,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:24:38,997 INFO L87 Difference]: Start difference. First operand 19407 states and 27006 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:39,147 INFO L93 Difference]: Finished difference Result 19407 states and 27006 transitions. [2024-10-12 20:24:39,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:24:39,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-10-12 20:24:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:39,166 INFO L225 Difference]: With dead ends: 19407 [2024-10-12 20:24:39,166 INFO L226 Difference]: Without dead ends: 19405 [2024-10-12 20:24:39,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:24:39,174 INFO L432 NwaCegarLoop]: 1120 mSDtfsCounter, 0 mSDsluCounter, 2238 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3358 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:39,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3358 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:24:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19405 states. [2024-10-12 20:24:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19405 to 19405. [2024-10-12 20:24:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19405 states, 19402 states have (on average 1.3890835996289042) internal successors, (26951), 19404 states have internal predecessors, (26951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19405 states to 19405 states and 26951 transitions. [2024-10-12 20:24:39,363 INFO L78 Accepts]: Start accepts. Automaton has 19405 states and 26951 transitions. Word has length 80 [2024-10-12 20:24:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:39,363 INFO L471 AbstractCegarLoop]: Abstraction has 19405 states and 26951 transitions. [2024-10-12 20:24:39,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 19405 states and 26951 transitions. [2024-10-12 20:24:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 20:24:39,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:39,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:39,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:24:39,372 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:39,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:39,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1443527492, now seen corresponding path program 1 times [2024-10-12 20:24:39,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:39,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552182385] [2024-10-12 20:24:39,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:39,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:39,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:39,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552182385] [2024-10-12 20:24:39,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552182385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:39,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:39,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:39,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25252793] [2024-10-12 20:24:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:39,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:24:39,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:39,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:24:39,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:24:39,594 INFO L87 Difference]: Start difference. First operand 19405 states and 26951 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:39,645 INFO L93 Difference]: Finished difference Result 19405 states and 26951 transitions. [2024-10-12 20:24:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:24:39,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-10-12 20:24:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:39,664 INFO L225 Difference]: With dead ends: 19405 [2024-10-12 20:24:39,665 INFO L226 Difference]: Without dead ends: 19403 [2024-10-12 20:24:39,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:24:39,672 INFO L432 NwaCegarLoop]: 1118 mSDtfsCounter, 0 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3352 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:39,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3352 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:24:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19403 states. [2024-10-12 20:24:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19403 to 19403. [2024-10-12 20:24:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19403 states, 19401 states have (on average 1.386320292768414) internal successors, (26896), 19402 states have internal predecessors, (26896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19403 states to 19403 states and 26896 transitions. [2024-10-12 20:24:39,881 INFO L78 Accepts]: Start accepts. Automaton has 19403 states and 26896 transitions. Word has length 80 [2024-10-12 20:24:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:39,881 INFO L471 AbstractCegarLoop]: Abstraction has 19403 states and 26896 transitions. [2024-10-12 20:24:39,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 19403 states and 26896 transitions. [2024-10-12 20:24:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 20:24:39,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:39,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:39,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:24:39,892 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:39,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:39,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1645930742, now seen corresponding path program 1 times [2024-10-12 20:24:39,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:39,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987998524] [2024-10-12 20:24:39,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:39,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:40,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:40,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987998524] [2024-10-12 20:24:40,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987998524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:40,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:40,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:24:40,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758793277] [2024-10-12 20:24:40,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:40,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:24:40,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:40,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:24:40,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:24:40,170 INFO L87 Difference]: Start difference. First operand 19403 states and 26896 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:41,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:41,267 INFO L93 Difference]: Finished difference Result 39304 states and 55410 transitions. [2024-10-12 20:24:41,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:24:41,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-10-12 20:24:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:41,295 INFO L225 Difference]: With dead ends: 39304 [2024-10-12 20:24:41,296 INFO L226 Difference]: Without dead ends: 28448 [2024-10-12 20:24:41,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:24:41,309 INFO L432 NwaCegarLoop]: 709 mSDtfsCounter, 4210 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4210 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:41,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4210 Valid, 2809 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:24:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28448 states. [2024-10-12 20:24:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28448 to 19403. [2024-10-12 20:24:41,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19403 states, 19401 states have (on average 1.3857017679501056) internal successors, (26884), 19402 states have internal predecessors, (26884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19403 states to 19403 states and 26884 transitions. [2024-10-12 20:24:41,603 INFO L78 Accepts]: Start accepts. Automaton has 19403 states and 26884 transitions. Word has length 82 [2024-10-12 20:24:41,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:41,603 INFO L471 AbstractCegarLoop]: Abstraction has 19403 states and 26884 transitions. [2024-10-12 20:24:41,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 19403 states and 26884 transitions. [2024-10-12 20:24:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 20:24:41,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:41,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:41,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:24:41,614 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:41,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:41,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1939644092, now seen corresponding path program 1 times [2024-10-12 20:24:41,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:41,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726114091] [2024-10-12 20:24:41,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:41,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:41,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:41,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726114091] [2024-10-12 20:24:41,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726114091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:41,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:41,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:24:41,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314623538] [2024-10-12 20:24:41,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:41,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:24:41,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:41,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:24:41,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:24:41,859 INFO L87 Difference]: Start difference. First operand 19403 states and 26884 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:41,902 INFO L93 Difference]: Finished difference Result 19403 states and 26884 transitions. [2024-10-12 20:24:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:24:41,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-10-12 20:24:41,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:41,921 INFO L225 Difference]: With dead ends: 19403 [2024-10-12 20:24:41,921 INFO L226 Difference]: Without dead ends: 19401 [2024-10-12 20:24:41,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:24:41,928 INFO L432 NwaCegarLoop]: 1115 mSDtfsCounter, 0 mSDsluCounter, 2228 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3343 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:41,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3343 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:24:41,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19401 states. [2024-10-12 20:24:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19401 to 19401. [2024-10-12 20:24:42,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19401 states, 19400 states have (on average 1.3815463917525774) internal successors, (26802), 19400 states have internal predecessors, (26802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19401 states to 19401 states and 26802 transitions. [2024-10-12 20:24:42,118 INFO L78 Accepts]: Start accepts. Automaton has 19401 states and 26802 transitions. Word has length 82 [2024-10-12 20:24:42,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:42,118 INFO L471 AbstractCegarLoop]: Abstraction has 19401 states and 26802 transitions. [2024-10-12 20:24:42,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand 19401 states and 26802 transitions. [2024-10-12 20:24:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 20:24:42,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:42,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:42,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:24:42,129 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:42,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:42,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1095070126, now seen corresponding path program 1 times [2024-10-12 20:24:42,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:42,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098862427] [2024-10-12 20:24:42,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:42,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:42,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:42,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098862427] [2024-10-12 20:24:42,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098862427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:42,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:42,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:24:42,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775518271] [2024-10-12 20:24:42,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:42,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:24:42,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:42,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:24:42,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:42,248 INFO L87 Difference]: Start difference. First operand 19401 states and 26802 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:43,160 INFO L93 Difference]: Finished difference Result 41835 states and 58866 transitions. [2024-10-12 20:24:43,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:24:43,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-12 20:24:43,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:43,198 INFO L225 Difference]: With dead ends: 41835 [2024-10-12 20:24:43,198 INFO L226 Difference]: Without dead ends: 34579 [2024-10-12 20:24:43,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:24:43,213 INFO L432 NwaCegarLoop]: 613 mSDtfsCounter, 4739 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4739 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:43,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4739 Valid, 1659 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:24:43,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34579 states. [2024-10-12 20:24:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34579 to 19491. [2024-10-12 20:24:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19491 states, 19490 states have (on average 1.381323755772191) internal successors, (26922), 19490 states have internal predecessors, (26922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19491 states to 19491 states and 26922 transitions. [2024-10-12 20:24:43,542 INFO L78 Accepts]: Start accepts. Automaton has 19491 states and 26922 transitions. Word has length 83 [2024-10-12 20:24:43,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:43,542 INFO L471 AbstractCegarLoop]: Abstraction has 19491 states and 26922 transitions. [2024-10-12 20:24:43,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 19491 states and 26922 transitions. [2024-10-12 20:24:43,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 20:24:43,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:43,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:43,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:24:43,552 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:43,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:43,553 INFO L85 PathProgramCache]: Analyzing trace with hash -966266279, now seen corresponding path program 1 times [2024-10-12 20:24:43,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:43,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644271688] [2024-10-12 20:24:43,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:43,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:44,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:44,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644271688] [2024-10-12 20:24:44,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644271688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:44,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:44,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:24:44,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743309968] [2024-10-12 20:24:44,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:44,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:24:44,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:44,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:24:44,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:24:44,357 INFO L87 Difference]: Start difference. First operand 19491 states and 26922 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:45,115 INFO L93 Difference]: Finished difference Result 43079 states and 60954 transitions. [2024-10-12 20:24:45,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:24:45,116 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-12 20:24:45,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:45,151 INFO L225 Difference]: With dead ends: 43079 [2024-10-12 20:24:45,151 INFO L226 Difference]: Without dead ends: 31539 [2024-10-12 20:24:45,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:24:45,167 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 7313 mSDsluCounter, 4743 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7313 SdHoareTripleChecker+Valid, 5753 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:45,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7313 Valid, 5753 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:24:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31539 states. [2024-10-12 20:24:45,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31539 to 18787. [2024-10-12 20:24:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18787 states, 18786 states have (on average 1.3834770573831576) internal successors, (25990), 18786 states have internal predecessors, (25990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18787 states to 18787 states and 25990 transitions. [2024-10-12 20:24:45,567 INFO L78 Accepts]: Start accepts. Automaton has 18787 states and 25990 transitions. Word has length 83 [2024-10-12 20:24:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:45,567 INFO L471 AbstractCegarLoop]: Abstraction has 18787 states and 25990 transitions. [2024-10-12 20:24:45,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:45,568 INFO L276 IsEmpty]: Start isEmpty. Operand 18787 states and 25990 transitions. [2024-10-12 20:24:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 20:24:45,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:45,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:45,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:24:45,576 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:45,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:45,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1906745732, now seen corresponding path program 1 times [2024-10-12 20:24:45,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:45,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180019397] [2024-10-12 20:24:45,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:45,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:45,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:45,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180019397] [2024-10-12 20:24:45,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180019397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:45,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:45,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:24:45,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210299320] [2024-10-12 20:24:45,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:45,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:24:45,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:45,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:24:45,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:24:45,881 INFO L87 Difference]: Start difference. First operand 18787 states and 25990 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:47,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:47,590 INFO L93 Difference]: Finished difference Result 30929 states and 43068 transitions. [2024-10-12 20:24:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:24:47,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-12 20:24:47,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:47,620 INFO L225 Difference]: With dead ends: 30929 [2024-10-12 20:24:47,620 INFO L226 Difference]: Without dead ends: 27120 [2024-10-12 20:24:47,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:24:47,632 INFO L432 NwaCegarLoop]: 599 mSDtfsCounter, 2313 mSDsluCounter, 2446 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2313 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:47,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2313 Valid, 3045 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:24:47,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27120 states. [2024-10-12 20:24:47,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27120 to 18791. [2024-10-12 20:24:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18791 states, 18790 states have (on average 1.3833422032996274) internal successors, (25993), 18790 states have internal predecessors, (25993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18791 states to 18791 states and 25993 transitions. [2024-10-12 20:24:47,914 INFO L78 Accepts]: Start accepts. Automaton has 18791 states and 25993 transitions. Word has length 83 [2024-10-12 20:24:47,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:47,915 INFO L471 AbstractCegarLoop]: Abstraction has 18791 states and 25993 transitions. [2024-10-12 20:24:47,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:47,915 INFO L276 IsEmpty]: Start isEmpty. Operand 18791 states and 25993 transitions. [2024-10-12 20:24:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 20:24:47,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:47,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:47,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:24:47,925 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:47,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2017272886, now seen corresponding path program 1 times [2024-10-12 20:24:47,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:47,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439694328] [2024-10-12 20:24:47,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:47,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:48,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:48,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:48,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439694328] [2024-10-12 20:24:48,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439694328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:48,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:48,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:24:48,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430084580] [2024-10-12 20:24:48,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:48,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:24:48,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:48,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:24:48,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:48,073 INFO L87 Difference]: Start difference. First operand 18791 states and 25993 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:49,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:49,082 INFO L93 Difference]: Finished difference Result 44707 states and 63162 transitions. [2024-10-12 20:24:49,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:24:49,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-12 20:24:49,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:49,124 INFO L225 Difference]: With dead ends: 44707 [2024-10-12 20:24:49,124 INFO L226 Difference]: Without dead ends: 37359 [2024-10-12 20:24:49,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:24:49,142 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 4657 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4657 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:49,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4657 Valid, 1639 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:24:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37359 states. [2024-10-12 20:24:49,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37359 to 18851. [2024-10-12 20:24:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18851 states, 18850 states have (on average 1.383183023872679) internal successors, (26073), 18850 states have internal predecessors, (26073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18851 states to 18851 states and 26073 transitions. [2024-10-12 20:24:49,457 INFO L78 Accepts]: Start accepts. Automaton has 18851 states and 26073 transitions. Word has length 83 [2024-10-12 20:24:49,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:49,457 INFO L471 AbstractCegarLoop]: Abstraction has 18851 states and 26073 transitions. [2024-10-12 20:24:49,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:49,458 INFO L276 IsEmpty]: Start isEmpty. Operand 18851 states and 26073 transitions. [2024-10-12 20:24:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 20:24:49,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:49,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:49,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 20:24:49,467 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:49,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:49,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2114418786, now seen corresponding path program 1 times [2024-10-12 20:24:49,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:49,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842636259] [2024-10-12 20:24:49,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:49,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:49,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:49,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842636259] [2024-10-12 20:24:49,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842636259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:49,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:49,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:24:49,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443988006] [2024-10-12 20:24:49,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:49,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:24:49,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:49,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:24:49,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:24:49,849 INFO L87 Difference]: Start difference. First operand 18851 states and 26073 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:51,038 INFO L93 Difference]: Finished difference Result 39375 states and 55466 transitions. [2024-10-12 20:24:51,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:24:51,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-12 20:24:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:51,073 INFO L225 Difference]: With dead ends: 39375 [2024-10-12 20:24:51,074 INFO L226 Difference]: Without dead ends: 28451 [2024-10-12 20:24:51,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:24:51,090 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 2445 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2445 SdHoareTripleChecker+Valid, 2823 SdHoareTripleChecker+Invalid, 2058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:51,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2445 Valid, 2823 Invalid, 2058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 20:24:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28451 states. [2024-10-12 20:24:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28451 to 18817. [2024-10-12 20:24:51,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18817 states, 18816 states have (on average 1.3829187925170068) internal successors, (26021), 18816 states have internal predecessors, (26021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18817 states to 18817 states and 26021 transitions. [2024-10-12 20:24:51,497 INFO L78 Accepts]: Start accepts. Automaton has 18817 states and 26021 transitions. Word has length 83 [2024-10-12 20:24:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:51,497 INFO L471 AbstractCegarLoop]: Abstraction has 18817 states and 26021 transitions. [2024-10-12 20:24:51,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 18817 states and 26021 transitions. [2024-10-12 20:24:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:24:51,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:51,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:51,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 20:24:51,510 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:51,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:51,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1936449238, now seen corresponding path program 1 times [2024-10-12 20:24:51,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:51,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050095542] [2024-10-12 20:24:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:51,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:51,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:51,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050095542] [2024-10-12 20:24:51,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050095542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:51,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:51,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:24:51,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486468514] [2024-10-12 20:24:51,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:51,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:24:51,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:51,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:24:51,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:24:51,800 INFO L87 Difference]: Start difference. First operand 18817 states and 26021 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:53,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:53,201 INFO L93 Difference]: Finished difference Result 32903 states and 45910 transitions. [2024-10-12 20:24:53,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:24:53,202 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 20:24:53,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:53,234 INFO L225 Difference]: With dead ends: 32903 [2024-10-12 20:24:53,234 INFO L226 Difference]: Without dead ends: 27140 [2024-10-12 20:24:53,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:24:53,247 INFO L432 NwaCegarLoop]: 599 mSDtfsCounter, 2310 mSDsluCounter, 2446 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2310 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 2634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:53,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2310 Valid, 3045 Invalid, 2634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2626 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:24:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27140 states. [2024-10-12 20:24:53,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27140 to 18813. [2024-10-12 20:24:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18813 states, 18812 states have (on average 1.3827875823942164) internal successors, (26013), 18812 states have internal predecessors, (26013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18813 states to 18813 states and 26013 transitions. [2024-10-12 20:24:53,509 INFO L78 Accepts]: Start accepts. Automaton has 18813 states and 26013 transitions. Word has length 84 [2024-10-12 20:24:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:53,509 INFO L471 AbstractCegarLoop]: Abstraction has 18813 states and 26013 transitions. [2024-10-12 20:24:53,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 18813 states and 26013 transitions. [2024-10-12 20:24:53,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:24:53,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:53,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:53,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 20:24:53,519 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:53,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:53,519 INFO L85 PathProgramCache]: Analyzing trace with hash -267386351, now seen corresponding path program 1 times [2024-10-12 20:24:53,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:53,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84331494] [2024-10-12 20:24:53,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:53,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:53,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:53,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84331494] [2024-10-12 20:24:53,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84331494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:53,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:53,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:24:53,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068043700] [2024-10-12 20:24:53,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:53,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:24:53,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:53,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:24:53,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:24:53,913 INFO L87 Difference]: Start difference. First operand 18813 states and 26013 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:54,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:54,689 INFO L93 Difference]: Finished difference Result 42539 states and 60196 transitions. [2024-10-12 20:24:54,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:24:54,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 20:24:54,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:54,725 INFO L225 Difference]: With dead ends: 42539 [2024-10-12 20:24:54,725 INFO L226 Difference]: Without dead ends: 31287 [2024-10-12 20:24:54,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:24:54,741 INFO L432 NwaCegarLoop]: 988 mSDtfsCounter, 6178 mSDsluCounter, 3669 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6178 SdHoareTripleChecker+Valid, 4657 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:54,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6178 Valid, 4657 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:24:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31287 states. [2024-10-12 20:24:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31287 to 18393. [2024-10-12 20:24:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18393 states, 18392 states have (on average 1.3846781209221402) internal successors, (25467), 18392 states have internal predecessors, (25467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18393 states to 18393 states and 25467 transitions. [2024-10-12 20:24:55,001 INFO L78 Accepts]: Start accepts. Automaton has 18393 states and 25467 transitions. Word has length 84 [2024-10-12 20:24:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:55,001 INFO L471 AbstractCegarLoop]: Abstraction has 18393 states and 25467 transitions. [2024-10-12 20:24:55,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand 18393 states and 25467 transitions. [2024-10-12 20:24:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:24:55,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:55,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:55,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 20:24:55,011 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:55,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:55,012 INFO L85 PathProgramCache]: Analyzing trace with hash 905787461, now seen corresponding path program 1 times [2024-10-12 20:24:55,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:55,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625156319] [2024-10-12 20:24:55,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:55,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:55,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:55,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625156319] [2024-10-12 20:24:55,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625156319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:55,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:55,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:24:55,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757179644] [2024-10-12 20:24:55,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:55,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:24:55,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:55,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:24:55,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:55,120 INFO L87 Difference]: Start difference. First operand 18393 states and 25467 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:56,066 INFO L93 Difference]: Finished difference Result 40803 states and 57515 transitions. [2024-10-12 20:24:56,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:24:56,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 20:24:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:56,102 INFO L225 Difference]: With dead ends: 40803 [2024-10-12 20:24:56,102 INFO L226 Difference]: Without dead ends: 33511 [2024-10-12 20:24:56,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:24:56,116 INFO L432 NwaCegarLoop]: 590 mSDtfsCounter, 4520 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4520 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:56,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4520 Valid, 1607 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:24:56,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33511 states. [2024-10-12 20:24:56,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33511 to 18588. [2024-10-12 20:24:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18588 states, 18587 states have (on average 1.384408457524076) internal successors, (25732), 18587 states have internal predecessors, (25732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18588 states to 18588 states and 25732 transitions. [2024-10-12 20:24:56,432 INFO L78 Accepts]: Start accepts. Automaton has 18588 states and 25732 transitions. Word has length 84 [2024-10-12 20:24:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:56,432 INFO L471 AbstractCegarLoop]: Abstraction has 18588 states and 25732 transitions. [2024-10-12 20:24:56,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 18588 states and 25732 transitions. [2024-10-12 20:24:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:24:56,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:56,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:56,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 20:24:56,442 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:56,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:56,442 INFO L85 PathProgramCache]: Analyzing trace with hash 344848121, now seen corresponding path program 1 times [2024-10-12 20:24:56,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:56,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039323482] [2024-10-12 20:24:56,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:56,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:56,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:56,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039323482] [2024-10-12 20:24:56,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039323482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:56,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:56,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:24:56,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851030316] [2024-10-12 20:24:56,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:56,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:24:56,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:56,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:24:56,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:24:56,897 INFO L87 Difference]: Start difference. First operand 18588 states and 25732 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:57,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:57,588 INFO L93 Difference]: Finished difference Result 42055 states and 59584 transitions. [2024-10-12 20:24:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:24:57,588 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 20:24:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:57,621 INFO L225 Difference]: With dead ends: 42055 [2024-10-12 20:24:57,621 INFO L226 Difference]: Without dead ends: 31075 [2024-10-12 20:24:57,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:24:57,637 INFO L432 NwaCegarLoop]: 957 mSDtfsCounter, 4987 mSDsluCounter, 4356 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4987 SdHoareTripleChecker+Valid, 5313 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:57,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4987 Valid, 5313 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:24:57,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31075 states. [2024-10-12 20:24:57,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31075 to 18464. [2024-10-12 20:24:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18464 states, 18463 states have (on average 1.3842820776688511) internal successors, (25558), 18463 states have internal predecessors, (25558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18464 states to 18464 states and 25558 transitions. [2024-10-12 20:24:57,863 INFO L78 Accepts]: Start accepts. Automaton has 18464 states and 25558 transitions. Word has length 84 [2024-10-12 20:24:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:57,863 INFO L471 AbstractCegarLoop]: Abstraction has 18464 states and 25558 transitions. [2024-10-12 20:24:57,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 18464 states and 25558 transitions. [2024-10-12 20:24:57,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:24:57,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:57,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:57,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-12 20:24:57,872 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:57,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:57,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1521972473, now seen corresponding path program 1 times [2024-10-12 20:24:57,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:57,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560696633] [2024-10-12 20:24:57,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:57,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:58,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:58,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560696633] [2024-10-12 20:24:58,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560696633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:58,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:58,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:24:58,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895799303] [2024-10-12 20:24:58,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:58,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:24:58,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:58,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:24:58,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:24:58,077 INFO L87 Difference]: Start difference. First operand 18464 states and 25558 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:24:59,151 INFO L93 Difference]: Finished difference Result 38853 states and 54800 transitions. [2024-10-12 20:24:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:24:59,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 20:24:59,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:24:59,189 INFO L225 Difference]: With dead ends: 38853 [2024-10-12 20:24:59,189 INFO L226 Difference]: Without dead ends: 27537 [2024-10-12 20:24:59,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:24:59,204 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 3354 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3354 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:24:59,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3354 Valid, 2786 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:24:59,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27537 states. [2024-10-12 20:24:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27537 to 18222. [2024-10-12 20:24:59,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18222 states, 18221 states have (on average 1.3845562812139838) internal successors, (25228), 18221 states have internal predecessors, (25228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18222 states to 18222 states and 25228 transitions. [2024-10-12 20:24:59,440 INFO L78 Accepts]: Start accepts. Automaton has 18222 states and 25228 transitions. Word has length 84 [2024-10-12 20:24:59,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:24:59,440 INFO L471 AbstractCegarLoop]: Abstraction has 18222 states and 25228 transitions. [2024-10-12 20:24:59,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:24:59,440 INFO L276 IsEmpty]: Start isEmpty. Operand 18222 states and 25228 transitions. [2024-10-12 20:24:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:24:59,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:24:59,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:24:59,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-12 20:24:59,450 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:24:59,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:24:59,451 INFO L85 PathProgramCache]: Analyzing trace with hash -962753776, now seen corresponding path program 1 times [2024-10-12 20:24:59,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:24:59,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805108594] [2024-10-12 20:24:59,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:24:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:24:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:24:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:24:59,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:24:59,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805108594] [2024-10-12 20:24:59,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805108594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:24:59,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:24:59,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:24:59,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516467759] [2024-10-12 20:24:59,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:24:59,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:24:59,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:24:59,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:24:59,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:24:59,588 INFO L87 Difference]: Start difference. First operand 18222 states and 25228 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:00,392 INFO L93 Difference]: Finished difference Result 48050 states and 68069 transitions. [2024-10-12 20:25:00,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:25:00,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 20:25:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:00,429 INFO L225 Difference]: With dead ends: 48050 [2024-10-12 20:25:00,430 INFO L226 Difference]: Without dead ends: 40448 [2024-10-12 20:25:00,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:25:00,441 INFO L432 NwaCegarLoop]: 610 mSDtfsCounter, 4500 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4500 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:00,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4500 Valid, 1596 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:25:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40448 states. [2024-10-12 20:25:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40448 to 18297. [2024-10-12 20:25:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18297 states, 18296 states have (on average 1.3843463052033231) internal successors, (25328), 18296 states have internal predecessors, (25328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18297 states to 18297 states and 25328 transitions. [2024-10-12 20:25:00,742 INFO L78 Accepts]: Start accepts. Automaton has 18297 states and 25328 transitions. Word has length 85 [2024-10-12 20:25:00,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:00,742 INFO L471 AbstractCegarLoop]: Abstraction has 18297 states and 25328 transitions. [2024-10-12 20:25:00,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 18297 states and 25328 transitions. [2024-10-12 20:25:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:25:00,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:00,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:00,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-12 20:25:00,752 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:00,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:00,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1055137432, now seen corresponding path program 1 times [2024-10-12 20:25:00,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:00,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371655223] [2024-10-12 20:25:00,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:00,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:00,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:00,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371655223] [2024-10-12 20:25:00,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371655223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:00,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:00,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:25:00,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427454606] [2024-10-12 20:25:00,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:00,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:25:00,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:00,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:25:00,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:25:00,991 INFO L87 Difference]: Start difference. First operand 18297 states and 25328 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:02,122 INFO L93 Difference]: Finished difference Result 43843 states and 61862 transitions. [2024-10-12 20:25:02,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:25:02,122 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 20:25:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:02,159 INFO L225 Difference]: With dead ends: 43843 [2024-10-12 20:25:02,159 INFO L226 Difference]: Without dead ends: 31939 [2024-10-12 20:25:02,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2024-10-12 20:25:02,177 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 3851 mSDsluCounter, 2437 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3851 SdHoareTripleChecker+Valid, 3066 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:02,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3851 Valid, 3066 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:25:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31939 states. [2024-10-12 20:25:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31939 to 17758. [2024-10-12 20:25:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17758 states, 17757 states have (on average 1.385031255279608) internal successors, (24594), 17757 states have internal predecessors, (24594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 24594 transitions. [2024-10-12 20:25:02,454 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 24594 transitions. Word has length 85 [2024-10-12 20:25:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:02,454 INFO L471 AbstractCegarLoop]: Abstraction has 17758 states and 24594 transitions. [2024-10-12 20:25:02,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 24594 transitions. [2024-10-12 20:25:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:25:02,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:02,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:02,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-12 20:25:02,464 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:02,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:02,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1379327747, now seen corresponding path program 1 times [2024-10-12 20:25:02,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:02,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711769060] [2024-10-12 20:25:02,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:02,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:02,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:02,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711769060] [2024-10-12 20:25:02,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711769060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:02,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:02,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:02,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724368065] [2024-10-12 20:25:02,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:02,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:25:02,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:02,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:25:02,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:25:02,687 INFO L87 Difference]: Start difference. First operand 17758 states and 24594 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:03,782 INFO L93 Difference]: Finished difference Result 37967 states and 53616 transitions. [2024-10-12 20:25:03,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:25:03,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 20:25:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:03,846 INFO L225 Difference]: With dead ends: 37967 [2024-10-12 20:25:03,846 INFO L226 Difference]: Without dead ends: 26945 [2024-10-12 20:25:03,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:25:03,874 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 3343 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3343 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:03,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3343 Valid, 3022 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:25:03,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26945 states. [2024-10-12 20:25:04,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26945 to 17675. [2024-10-12 20:25:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17675 states, 17674 states have (on average 1.384689374222021) internal successors, (24473), 17674 states have internal predecessors, (24473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17675 states to 17675 states and 24473 transitions. [2024-10-12 20:25:04,110 INFO L78 Accepts]: Start accepts. Automaton has 17675 states and 24473 transitions. Word has length 85 [2024-10-12 20:25:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:04,110 INFO L471 AbstractCegarLoop]: Abstraction has 17675 states and 24473 transitions. [2024-10-12 20:25:04,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:04,111 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 24473 transitions. [2024-10-12 20:25:04,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:25:04,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:04,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:04,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-12 20:25:04,119 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:04,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:04,123 INFO L85 PathProgramCache]: Analyzing trace with hash -964015433, now seen corresponding path program 1 times [2024-10-12 20:25:04,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:04,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633036534] [2024-10-12 20:25:04,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:04,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:04,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633036534] [2024-10-12 20:25:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633036534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:04,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:04,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:04,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292263024] [2024-10-12 20:25:04,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:04,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:04,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:04,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:04,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:04,207 INFO L87 Difference]: Start difference. First operand 17675 states and 24473 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:04,293 INFO L93 Difference]: Finished difference Result 26108 states and 36472 transitions. [2024-10-12 20:25:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:04,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 20:25:04,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:04,312 INFO L225 Difference]: With dead ends: 26108 [2024-10-12 20:25:04,312 INFO L226 Difference]: Without dead ends: 17677 [2024-10-12 20:25:04,322 INFO L431 NwaCegarLoop]: 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 [2024-10-12 20:25:04,322 INFO L432 NwaCegarLoop]: 1295 mSDtfsCounter, 640 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 2213 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:04,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 2213 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:04,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17677 states. [2024-10-12 20:25:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17677 to 17675. [2024-10-12 20:25:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17675 states, 17674 states have (on average 1.3742220210478668) internal successors, (24288), 17674 states have internal predecessors, (24288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17675 states to 17675 states and 24288 transitions. [2024-10-12 20:25:04,505 INFO L78 Accepts]: Start accepts. Automaton has 17675 states and 24288 transitions. Word has length 85 [2024-10-12 20:25:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:04,505 INFO L471 AbstractCegarLoop]: Abstraction has 17675 states and 24288 transitions. [2024-10-12 20:25:04,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 24288 transitions. [2024-10-12 20:25:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 20:25:04,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:04,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:04,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-12 20:25:04,515 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:04,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:04,515 INFO L85 PathProgramCache]: Analyzing trace with hash 520335053, now seen corresponding path program 1 times [2024-10-12 20:25:04,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:04,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195546180] [2024-10-12 20:25:04,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:04,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:04,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:04,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195546180] [2024-10-12 20:25:04,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195546180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:04,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:04,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:25:04,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877121350] [2024-10-12 20:25:04,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:04,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:25:04,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:04,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:25:04,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:25:04,992 INFO L87 Difference]: Start difference. First operand 17675 states and 24288 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:06,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:06,414 INFO L93 Difference]: Finished difference Result 59392 states and 83973 transitions. [2024-10-12 20:25:06,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 20:25:06,414 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-12 20:25:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:06,468 INFO L225 Difference]: With dead ends: 59392 [2024-10-12 20:25:06,468 INFO L226 Difference]: Without dead ends: 48524 [2024-10-12 20:25:06,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2024-10-12 20:25:06,491 INFO L432 NwaCegarLoop]: 849 mSDtfsCounter, 7788 mSDsluCounter, 4716 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7788 SdHoareTripleChecker+Valid, 5565 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:06,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7788 Valid, 5565 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 20:25:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48524 states. [2024-10-12 20:25:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48524 to 17699. [2024-10-12 20:25:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17699 states, 17698 states have (on average 1.3743925867329643) internal successors, (24324), 17698 states have internal predecessors, (24324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17699 states to 17699 states and 24324 transitions. [2024-10-12 20:25:06,828 INFO L78 Accepts]: Start accepts. Automaton has 17699 states and 24324 transitions. Word has length 86 [2024-10-12 20:25:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:06,828 INFO L471 AbstractCegarLoop]: Abstraction has 17699 states and 24324 transitions. [2024-10-12 20:25:06,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 17699 states and 24324 transitions. [2024-10-12 20:25:06,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 20:25:06,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:06,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:06,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-12 20:25:06,838 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:06,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:06,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1157692377, now seen corresponding path program 1 times [2024-10-12 20:25:06,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:06,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939507118] [2024-10-12 20:25:06,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:06,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:06,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:06,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939507118] [2024-10-12 20:25:06,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939507118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:06,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:06,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:25:06,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146383432] [2024-10-12 20:25:06,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:06,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:25:06,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:06,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:25:06,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:06,940 INFO L87 Difference]: Start difference. First operand 17699 states and 24324 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:07,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:07,696 INFO L93 Difference]: Finished difference Result 43568 states and 61319 transitions. [2024-10-12 20:25:07,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:25:07,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-12 20:25:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:07,738 INFO L225 Difference]: With dead ends: 43568 [2024-10-12 20:25:07,738 INFO L226 Difference]: Without dead ends: 36224 [2024-10-12 20:25:07,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:25:07,755 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 4441 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4441 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:07,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4441 Valid, 1583 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:25:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36224 states. [2024-10-12 20:25:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36224 to 17781. [2024-10-12 20:25:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17781 states, 17780 states have (on average 1.3741282339707537) internal successors, (24432), 17780 states have internal predecessors, (24432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17781 states to 17781 states and 24432 transitions. [2024-10-12 20:25:08,081 INFO L78 Accepts]: Start accepts. Automaton has 17781 states and 24432 transitions. Word has length 86 [2024-10-12 20:25:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:08,082 INFO L471 AbstractCegarLoop]: Abstraction has 17781 states and 24432 transitions. [2024-10-12 20:25:08,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 17781 states and 24432 transitions. [2024-10-12 20:25:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 20:25:08,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:08,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:08,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-12 20:25:08,092 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:08,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1566150893, now seen corresponding path program 1 times [2024-10-12 20:25:08,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:08,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475570410] [2024-10-12 20:25:08,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:08,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:08,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:08,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475570410] [2024-10-12 20:25:08,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475570410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:08,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:08,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:25:08,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777388122] [2024-10-12 20:25:08,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:08,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:25:08,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:08,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:25:08,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:08,197 INFO L87 Difference]: Start difference. First operand 17781 states and 24432 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:09,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:09,013 INFO L93 Difference]: Finished difference Result 39840 states and 55812 transitions. [2024-10-12 20:25:09,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:25:09,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-12 20:25:09,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:09,050 INFO L225 Difference]: With dead ends: 39840 [2024-10-12 20:25:09,050 INFO L226 Difference]: Without dead ends: 32608 [2024-10-12 20:25:09,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:25:09,065 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 4357 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4357 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:09,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4357 Valid, 1575 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:25:09,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32608 states. [2024-10-12 20:25:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32608 to 17863. [2024-10-12 20:25:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17863 states, 17862 states have (on average 1.373642369275557) internal successors, (24536), 17862 states have internal predecessors, (24536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17863 states to 17863 states and 24536 transitions. [2024-10-12 20:25:09,361 INFO L78 Accepts]: Start accepts. Automaton has 17863 states and 24536 transitions. Word has length 86 [2024-10-12 20:25:09,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:09,361 INFO L471 AbstractCegarLoop]: Abstraction has 17863 states and 24536 transitions. [2024-10-12 20:25:09,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 17863 states and 24536 transitions. [2024-10-12 20:25:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 20:25:09,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:09,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:09,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-12 20:25:09,371 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:09,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:09,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1754590955, now seen corresponding path program 1 times [2024-10-12 20:25:09,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:09,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726352921] [2024-10-12 20:25:09,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:09,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:09,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:09,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726352921] [2024-10-12 20:25:09,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726352921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:09,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:09,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:25:09,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513080767] [2024-10-12 20:25:09,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:09,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:25:09,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:09,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:25:09,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:25:09,759 INFO L87 Difference]: Start difference. First operand 17863 states and 24536 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:10,800 INFO L93 Difference]: Finished difference Result 37622 states and 52769 transitions. [2024-10-12 20:25:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:25:10,800 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-12 20:25:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:10,836 INFO L225 Difference]: With dead ends: 37622 [2024-10-12 20:25:10,836 INFO L226 Difference]: Without dead ends: 32686 [2024-10-12 20:25:10,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:25:10,853 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 6730 mSDsluCounter, 3777 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6730 SdHoareTripleChecker+Valid, 4601 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:10,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6730 Valid, 4601 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:25:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32686 states. [2024-10-12 20:25:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32686 to 17877. [2024-10-12 20:25:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17877 states, 17876 states have (on average 1.373685388230029) internal successors, (24556), 17876 states have internal predecessors, (24556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17877 states to 17877 states and 24556 transitions. [2024-10-12 20:25:11,128 INFO L78 Accepts]: Start accepts. Automaton has 17877 states and 24556 transitions. Word has length 86 [2024-10-12 20:25:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:11,128 INFO L471 AbstractCegarLoop]: Abstraction has 17877 states and 24556 transitions. [2024-10-12 20:25:11,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 17877 states and 24556 transitions. [2024-10-12 20:25:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 20:25:11,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:11,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:11,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-12 20:25:11,139 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:11,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:11,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1977032355, now seen corresponding path program 1 times [2024-10-12 20:25:11,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:11,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986737285] [2024-10-12 20:25:11,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:11,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:11,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:11,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986737285] [2024-10-12 20:25:11,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986737285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:11,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:11,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:11,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978331703] [2024-10-12 20:25:11,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:11,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:11,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:11,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:11,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:11,193 INFO L87 Difference]: Start difference. First operand 17877 states and 24556 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:11,308 INFO L93 Difference]: Finished difference Result 32155 states and 44526 transitions. [2024-10-12 20:25:11,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:11,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-12 20:25:11,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:11,331 INFO L225 Difference]: With dead ends: 32155 [2024-10-12 20:25:11,331 INFO L226 Difference]: Without dead ends: 21759 [2024-10-12 20:25:11,343 INFO L431 NwaCegarLoop]: 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 [2024-10-12 20:25:11,344 INFO L432 NwaCegarLoop]: 1055 mSDtfsCounter, 954 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:11,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 1345 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:25:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21759 states. [2024-10-12 20:25:11,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21759 to 16690. [2024-10-12 20:25:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16690 states, 16689 states have (on average 1.3764156030918568) internal successors, (22971), 16689 states have internal predecessors, (22971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16690 states to 16690 states and 22971 transitions. [2024-10-12 20:25:11,537 INFO L78 Accepts]: Start accepts. Automaton has 16690 states and 22971 transitions. Word has length 86 [2024-10-12 20:25:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:11,538 INFO L471 AbstractCegarLoop]: Abstraction has 16690 states and 22971 transitions. [2024-10-12 20:25:11,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand 16690 states and 22971 transitions. [2024-10-12 20:25:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 20:25:11,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:11,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:11,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-12 20:25:11,547 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:11,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1834797419, now seen corresponding path program 1 times [2024-10-12 20:25:11,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:11,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201112683] [2024-10-12 20:25:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:11,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:11,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:11,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201112683] [2024-10-12 20:25:11,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201112683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:11,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:11,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:11,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254678935] [2024-10-12 20:25:11,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:11,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:25:11,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:11,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:25:11,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:25:11,744 INFO L87 Difference]: Start difference. First operand 16690 states and 22971 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:12,734 INFO L93 Difference]: Finished difference Result 28339 states and 39548 transitions. [2024-10-12 20:25:12,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:25:12,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-12 20:25:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:12,760 INFO L225 Difference]: With dead ends: 28339 [2024-10-12 20:25:12,761 INFO L226 Difference]: Without dead ends: 24657 [2024-10-12 20:25:12,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:25:12,772 INFO L432 NwaCegarLoop]: 652 mSDtfsCounter, 2305 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2305 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:12,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2305 Valid, 2720 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2025 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:25:12,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24657 states. [2024-10-12 20:25:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24657 to 16686. [2024-10-12 20:25:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16686 states, 16685 states have (on average 1.3762661072819897) internal successors, (22963), 16685 states have internal predecessors, (22963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16686 states to 16686 states and 22963 transitions. [2024-10-12 20:25:12,999 INFO L78 Accepts]: Start accepts. Automaton has 16686 states and 22963 transitions. Word has length 87 [2024-10-12 20:25:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:12,999 INFO L471 AbstractCegarLoop]: Abstraction has 16686 states and 22963 transitions. [2024-10-12 20:25:12,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 16686 states and 22963 transitions. [2024-10-12 20:25:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 20:25:13,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:13,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:13,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-12 20:25:13,010 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:13,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash -842652533, now seen corresponding path program 1 times [2024-10-12 20:25:13,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:13,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228226260] [2024-10-12 20:25:13,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:13,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:13,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:13,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228226260] [2024-10-12 20:25:13,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228226260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:13,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:13,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:13,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263329999] [2024-10-12 20:25:13,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:13,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:13,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:13,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:13,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:13,060 INFO L87 Difference]: Start difference. First operand 16686 states and 22963 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:13,252 INFO L93 Difference]: Finished difference Result 32684 states and 45459 transitions. [2024-10-12 20:25:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:13,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-12 20:25:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:13,277 INFO L225 Difference]: With dead ends: 32684 [2024-10-12 20:25:13,278 INFO L226 Difference]: Without dead ends: 23294 [2024-10-12 20:25:13,290 INFO L431 NwaCegarLoop]: 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 [2024-10-12 20:25:13,291 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 838 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:13,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 990 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:25:13,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23294 states. [2024-10-12 20:25:13,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23294 to 23238. [2024-10-12 20:25:13,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23238 states, 23237 states have (on average 1.3950596032190041) internal successors, (32417), 23237 states have internal predecessors, (32417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23238 states to 23238 states and 32417 transitions. [2024-10-12 20:25:13,539 INFO L78 Accepts]: Start accepts. Automaton has 23238 states and 32417 transitions. Word has length 87 [2024-10-12 20:25:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:13,540 INFO L471 AbstractCegarLoop]: Abstraction has 23238 states and 32417 transitions. [2024-10-12 20:25:13,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 23238 states and 32417 transitions. [2024-10-12 20:25:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 20:25:13,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:13,550 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:13,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-12 20:25:13,550 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:13,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:13,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1484970449, now seen corresponding path program 1 times [2024-10-12 20:25:13,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:13,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064993751] [2024-10-12 20:25:13,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:13,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:13,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:13,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064993751] [2024-10-12 20:25:13,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064993751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:13,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:13,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:25:13,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452905423] [2024-10-12 20:25:13,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:13,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:25:13,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:13,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:25:13,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:25:13,892 INFO L87 Difference]: Start difference. First operand 23238 states and 32417 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:15,027 INFO L93 Difference]: Finished difference Result 38705 states and 54534 transitions. [2024-10-12 20:25:15,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:25:15,028 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-12 20:25:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:15,060 INFO L225 Difference]: With dead ends: 38705 [2024-10-12 20:25:15,060 INFO L226 Difference]: Without dead ends: 26844 [2024-10-12 20:25:15,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:25:15,076 INFO L432 NwaCegarLoop]: 555 mSDtfsCounter, 2647 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2647 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:15,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2647 Valid, 3045 Invalid, 2203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2197 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:25:15,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26844 states. [2024-10-12 20:25:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26844 to 23242. [2024-10-12 20:25:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23242 states, 23241 states have (on average 1.3949485822468912) internal successors, (32420), 23241 states have internal predecessors, (32420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23242 states to 23242 states and 32420 transitions. [2024-10-12 20:25:15,342 INFO L78 Accepts]: Start accepts. Automaton has 23242 states and 32420 transitions. Word has length 87 [2024-10-12 20:25:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:15,343 INFO L471 AbstractCegarLoop]: Abstraction has 23242 states and 32420 transitions. [2024-10-12 20:25:15,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 23242 states and 32420 transitions. [2024-10-12 20:25:15,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 20:25:15,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:15,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:15,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-12 20:25:15,354 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:15,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:15,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1835771399, now seen corresponding path program 1 times [2024-10-12 20:25:15,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:15,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667128700] [2024-10-12 20:25:15,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:15,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:15,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:15,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667128700] [2024-10-12 20:25:15,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667128700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:15,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:15,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:15,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327862159] [2024-10-12 20:25:15,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:15,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:25:15,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:15,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:25:15,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:25:15,537 INFO L87 Difference]: Start difference. First operand 23242 states and 32420 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:16,493 INFO L93 Difference]: Finished difference Result 53558 states and 75960 transitions. [2024-10-12 20:25:16,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:25:16,494 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-12 20:25:16,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:16,536 INFO L225 Difference]: With dead ends: 53558 [2024-10-12 20:25:16,536 INFO L226 Difference]: Without dead ends: 36034 [2024-10-12 20:25:16,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:25:16,556 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 2350 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2350 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:16,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2350 Valid, 2358 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:25:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36034 states. [2024-10-12 20:25:16,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36034 to 23248. [2024-10-12 20:25:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23248 states, 23247 states have (on average 1.3947606142728093) internal successors, (32424), 23247 states have internal predecessors, (32424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23248 states to 23248 states and 32424 transitions. [2024-10-12 20:25:16,868 INFO L78 Accepts]: Start accepts. Automaton has 23248 states and 32424 transitions. Word has length 87 [2024-10-12 20:25:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:16,869 INFO L471 AbstractCegarLoop]: Abstraction has 23248 states and 32424 transitions. [2024-10-12 20:25:16,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 23248 states and 32424 transitions. [2024-10-12 20:25:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 20:25:16,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:16,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:16,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-12 20:25:16,879 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:16,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:16,880 INFO L85 PathProgramCache]: Analyzing trace with hash -797370937, now seen corresponding path program 1 times [2024-10-12 20:25:16,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:16,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504405205] [2024-10-12 20:25:16,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:16,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:16,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504405205] [2024-10-12 20:25:16,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504405205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:16,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:16,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:16,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545803217] [2024-10-12 20:25:16,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:16,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:16,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:16,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:16,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:16,933 INFO L87 Difference]: Start difference. First operand 23248 states and 32424 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:17,012 INFO L93 Difference]: Finished difference Result 36087 states and 50644 transitions. [2024-10-12 20:25:17,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:17,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-12 20:25:17,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:17,035 INFO L225 Difference]: With dead ends: 36087 [2024-10-12 20:25:17,035 INFO L226 Difference]: Without dead ends: 23250 [2024-10-12 20:25:17,049 INFO L431 NwaCegarLoop]: 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 [2024-10-12 20:25:17,049 INFO L432 NwaCegarLoop]: 1144 mSDtfsCounter, 599 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:17,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1916 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23250 states. [2024-10-12 20:25:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23250 to 23248. [2024-10-12 20:25:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23248 states, 23247 states have (on average 1.385512109089345) internal successors, (32209), 23247 states have internal predecessors, (32209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23248 states to 23248 states and 32209 transitions. [2024-10-12 20:25:17,297 INFO L78 Accepts]: Start accepts. Automaton has 23248 states and 32209 transitions. Word has length 87 [2024-10-12 20:25:17,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:17,298 INFO L471 AbstractCegarLoop]: Abstraction has 23248 states and 32209 transitions. [2024-10-12 20:25:17,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand 23248 states and 32209 transitions. [2024-10-12 20:25:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 20:25:17,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:17,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:17,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-12 20:25:17,308 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:17,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:17,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1222876658, now seen corresponding path program 1 times [2024-10-12 20:25:17,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:17,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208656535] [2024-10-12 20:25:17,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:17,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:17,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:17,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208656535] [2024-10-12 20:25:17,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208656535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:17,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:17,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:17,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183631353] [2024-10-12 20:25:17,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:17,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:25:17,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:25:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:25:17,491 INFO L87 Difference]: Start difference. First operand 23248 states and 32209 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:18,452 INFO L93 Difference]: Finished difference Result 38086 states and 53167 transitions. [2024-10-12 20:25:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:25:18,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-12 20:25:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:18,490 INFO L225 Difference]: With dead ends: 38086 [2024-10-12 20:25:18,490 INFO L226 Difference]: Without dead ends: 36030 [2024-10-12 20:25:18,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:25:18,505 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 3511 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3511 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:18,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3511 Valid, 2363 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:25:18,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36030 states. [2024-10-12 20:25:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36030 to 23244. [2024-10-12 20:25:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23244 states, 23243 states have (on average 1.385406358903756) internal successors, (32201), 23243 states have internal predecessors, (32201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23244 states to 23244 states and 32201 transitions. [2024-10-12 20:25:19,022 INFO L78 Accepts]: Start accepts. Automaton has 23244 states and 32201 transitions. Word has length 87 [2024-10-12 20:25:19,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:19,022 INFO L471 AbstractCegarLoop]: Abstraction has 23244 states and 32201 transitions. [2024-10-12 20:25:19,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 23244 states and 32201 transitions. [2024-10-12 20:25:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 20:25:19,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:19,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:19,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-12 20:25:19,033 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:19,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1827433133, now seen corresponding path program 1 times [2024-10-12 20:25:19,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:19,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583791304] [2024-10-12 20:25:19,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:19,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:19,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:19,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583791304] [2024-10-12 20:25:19,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583791304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:19,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:19,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:19,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320340006] [2024-10-12 20:25:19,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:19,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:19,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:19,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:19,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:19,082 INFO L87 Difference]: Start difference. First operand 23244 states and 32201 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:19,201 INFO L93 Difference]: Finished difference Result 43834 states and 61106 transitions. [2024-10-12 20:25:19,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:19,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-12 20:25:19,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:19,234 INFO L225 Difference]: With dead ends: 43834 [2024-10-12 20:25:19,235 INFO L226 Difference]: Without dead ends: 29668 [2024-10-12 20:25:19,252 INFO L431 NwaCegarLoop]: 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 [2024-10-12 20:25:19,253 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 859 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:19,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1238 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29668 states. [2024-10-12 20:25:19,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29668 to 22374. [2024-10-12 20:25:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22374 states, 22373 states have (on average 1.3866714343181514) internal successors, (31024), 22373 states have internal predecessors, (31024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22374 states to 22374 states and 31024 transitions. [2024-10-12 20:25:19,523 INFO L78 Accepts]: Start accepts. Automaton has 22374 states and 31024 transitions. Word has length 88 [2024-10-12 20:25:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:19,523 INFO L471 AbstractCegarLoop]: Abstraction has 22374 states and 31024 transitions. [2024-10-12 20:25:19,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 22374 states and 31024 transitions. [2024-10-12 20:25:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 20:25:19,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:19,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:19,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-12 20:25:19,533 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:19,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:19,533 INFO L85 PathProgramCache]: Analyzing trace with hash -134276048, now seen corresponding path program 1 times [2024-10-12 20:25:19,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:19,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823651611] [2024-10-12 20:25:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:19,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:19,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:19,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823651611] [2024-10-12 20:25:19,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823651611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:19,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:19,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:19,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254452920] [2024-10-12 20:25:19,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:19,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:19,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:19,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:19,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:19,590 INFO L87 Difference]: Start difference. First operand 22374 states and 31024 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:19,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:19,702 INFO L93 Difference]: Finished difference Result 29324 states and 40816 transitions. [2024-10-12 20:25:19,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:19,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-12 20:25:19,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:19,721 INFO L225 Difference]: With dead ends: 29324 [2024-10-12 20:25:19,721 INFO L226 Difference]: Without dead ends: 18856 [2024-10-12 20:25:19,731 INFO L431 NwaCegarLoop]: 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 [2024-10-12 20:25:19,732 INFO L432 NwaCegarLoop]: 1080 mSDtfsCounter, 529 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:19,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1580 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:25:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18856 states. [2024-10-12 20:25:19,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18856 to 14861. [2024-10-12 20:25:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14861 states, 14860 states have (on average 1.35814266487214) internal successors, (20182), 14860 states have internal predecessors, (20182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14861 states to 14861 states and 20182 transitions. [2024-10-12 20:25:19,900 INFO L78 Accepts]: Start accepts. Automaton has 14861 states and 20182 transitions. Word has length 88 [2024-10-12 20:25:19,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:19,900 INFO L471 AbstractCegarLoop]: Abstraction has 14861 states and 20182 transitions. [2024-10-12 20:25:19,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 14861 states and 20182 transitions. [2024-10-12 20:25:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 20:25:19,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:19,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:19,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-12 20:25:19,909 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:19,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1533009072, now seen corresponding path program 1 times [2024-10-12 20:25:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:19,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324475551] [2024-10-12 20:25:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:19,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:19,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:19,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324475551] [2024-10-12 20:25:19,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324475551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:19,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:19,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:19,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59608112] [2024-10-12 20:25:19,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:19,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:19,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:19,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:19,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:19,960 INFO L87 Difference]: Start difference. First operand 14861 states and 20182 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:20,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:20,097 INFO L93 Difference]: Finished difference Result 29879 states and 41117 transitions. [2024-10-12 20:25:20,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:20,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-12 20:25:20,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:20,122 INFO L225 Difference]: With dead ends: 29879 [2024-10-12 20:25:20,122 INFO L226 Difference]: Without dead ends: 21012 [2024-10-12 20:25:20,133 INFO L431 NwaCegarLoop]: 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 [2024-10-12 20:25:20,133 INFO L432 NwaCegarLoop]: 706 mSDtfsCounter, 690 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:20,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 943 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:25:20,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21012 states. [2024-10-12 20:25:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21012 to 20956. [2024-10-12 20:25:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20956 states, 20955 states have (on average 1.3799093295156288) internal successors, (28916), 20955 states have internal predecessors, (28916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20956 states to 20956 states and 28916 transitions. [2024-10-12 20:25:20,323 INFO L78 Accepts]: Start accepts. Automaton has 20956 states and 28916 transitions. Word has length 88 [2024-10-12 20:25:20,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:20,323 INFO L471 AbstractCegarLoop]: Abstraction has 20956 states and 28916 transitions. [2024-10-12 20:25:20,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 20956 states and 28916 transitions. [2024-10-12 20:25:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 20:25:20,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:20,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:20,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-12 20:25:20,332 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:20,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:20,332 INFO L85 PathProgramCache]: Analyzing trace with hash -640905836, now seen corresponding path program 1 times [2024-10-12 20:25:20,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:20,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928167185] [2024-10-12 20:25:20,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:20,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:20,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:20,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928167185] [2024-10-12 20:25:20,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928167185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:20,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:20,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:20,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071974360] [2024-10-12 20:25:20,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:20,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:20,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:20,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:20,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:20,383 INFO L87 Difference]: Start difference. First operand 20956 states and 28916 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:20,452 INFO L93 Difference]: Finished difference Result 30135 states and 41540 transitions. [2024-10-12 20:25:20,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:20,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-12 20:25:20,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:20,473 INFO L225 Difference]: With dead ends: 30135 [2024-10-12 20:25:20,473 INFO L226 Difference]: Without dead ends: 20637 [2024-10-12 20:25:20,484 INFO L431 NwaCegarLoop]: 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 [2024-10-12 20:25:20,485 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 531 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:20,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1291 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20637 states. [2024-10-12 20:25:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20637 to 20635. [2024-10-12 20:25:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20635 states, 20634 states have (on average 1.368469516332267) internal successors, (28237), 20634 states have internal predecessors, (28237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20635 states to 20635 states and 28237 transitions. [2024-10-12 20:25:20,676 INFO L78 Accepts]: Start accepts. Automaton has 20635 states and 28237 transitions. Word has length 88 [2024-10-12 20:25:20,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:20,676 INFO L471 AbstractCegarLoop]: Abstraction has 20635 states and 28237 transitions. [2024-10-12 20:25:20,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:20,677 INFO L276 IsEmpty]: Start isEmpty. Operand 20635 states and 28237 transitions. [2024-10-12 20:25:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 20:25:20,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:20,685 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:20,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-12 20:25:20,685 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:20,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:20,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1931785488, now seen corresponding path program 1 times [2024-10-12 20:25:20,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:20,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237984398] [2024-10-12 20:25:20,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:20,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:21,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:21,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237984398] [2024-10-12 20:25:21,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237984398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:21,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:21,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:25:21,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144023101] [2024-10-12 20:25:21,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:21,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:25:21,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:21,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:25:21,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:25:21,078 INFO L87 Difference]: Start difference. First operand 20635 states and 28237 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:21,833 INFO L93 Difference]: Finished difference Result 33474 states and 46112 transitions. [2024-10-12 20:25:21,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:25:21,834 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-12 20:25:21,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:21,873 INFO L225 Difference]: With dead ends: 33474 [2024-10-12 20:25:21,873 INFO L226 Difference]: Without dead ends: 32411 [2024-10-12 20:25:21,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:25:21,886 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 4265 mSDsluCounter, 3236 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 3982 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:21,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 3982 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:25:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32411 states. [2024-10-12 20:25:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32411 to 20622. [2024-10-12 20:25:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20622 states, 20621 states have (on average 1.368507831821929) internal successors, (28220), 20621 states have internal predecessors, (28220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20622 states to 20622 states and 28220 transitions. [2024-10-12 20:25:22,369 INFO L78 Accepts]: Start accepts. Automaton has 20622 states and 28220 transitions. Word has length 88 [2024-10-12 20:25:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:22,369 INFO L471 AbstractCegarLoop]: Abstraction has 20622 states and 28220 transitions. [2024-10-12 20:25:22,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 20622 states and 28220 transitions. [2024-10-12 20:25:22,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 20:25:22,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:22,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:22,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-12 20:25:22,379 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:22,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:22,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1107155266, now seen corresponding path program 1 times [2024-10-12 20:25:22,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:22,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824190878] [2024-10-12 20:25:22,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:22,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:22,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:22,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824190878] [2024-10-12 20:25:22,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824190878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:22,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:22,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:22,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667531546] [2024-10-12 20:25:22,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:22,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:25:22,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:22,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:25:22,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:25:22,666 INFO L87 Difference]: Start difference. First operand 20622 states and 28220 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:23,534 INFO L93 Difference]: Finished difference Result 27783 states and 38019 transitions. [2024-10-12 20:25:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:25:23,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-12 20:25:23,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:23,568 INFO L225 Difference]: With dead ends: 27783 [2024-10-12 20:25:23,568 INFO L226 Difference]: Without dead ends: 27402 [2024-10-12 20:25:23,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:25:23,580 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 2788 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2788 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:23,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2788 Valid, 2072 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:25:23,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27402 states. [2024-10-12 20:25:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27402 to 20613. [2024-10-12 20:25:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20613 states, 20612 states have (on average 1.368426159518727) internal successors, (28206), 20612 states have internal predecessors, (28206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20613 states to 20613 states and 28206 transitions. [2024-10-12 20:25:23,985 INFO L78 Accepts]: Start accepts. Automaton has 20613 states and 28206 transitions. Word has length 89 [2024-10-12 20:25:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:23,985 INFO L471 AbstractCegarLoop]: Abstraction has 20613 states and 28206 transitions. [2024-10-12 20:25:23,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 20613 states and 28206 transitions. [2024-10-12 20:25:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 20:25:23,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:23,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:23,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-12 20:25:23,994 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:23,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:23,995 INFO L85 PathProgramCache]: Analyzing trace with hash -515965658, now seen corresponding path program 1 times [2024-10-12 20:25:23,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:23,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927249091] [2024-10-12 20:25:23,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:23,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:24,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:24,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927249091] [2024-10-12 20:25:24,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927249091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:24,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:24,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:24,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691144401] [2024-10-12 20:25:24,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:24,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:25:24,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:24,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:25:24,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:25:24,176 INFO L87 Difference]: Start difference. First operand 20613 states and 28206 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:25,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:25,006 INFO L93 Difference]: Finished difference Result 33033 states and 45375 transitions. [2024-10-12 20:25:25,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:25:25,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-12 20:25:25,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:25,042 INFO L225 Difference]: With dead ends: 33033 [2024-10-12 20:25:25,042 INFO L226 Difference]: Without dead ends: 32652 [2024-10-12 20:25:25,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:25:25,054 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 1634 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 2400 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:25,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 2400 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:25:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32652 states. [2024-10-12 20:25:25,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32652 to 20604. [2024-10-12 20:25:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20604 states, 20603 states have (on average 1.3683444158617677) internal successors, (28192), 20603 states have internal predecessors, (28192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20604 states to 20604 states and 28192 transitions. [2024-10-12 20:25:25,345 INFO L78 Accepts]: Start accepts. Automaton has 20604 states and 28192 transitions. Word has length 89 [2024-10-12 20:25:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:25,346 INFO L471 AbstractCegarLoop]: Abstraction has 20604 states and 28192 transitions. [2024-10-12 20:25:25,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 20604 states and 28192 transitions. [2024-10-12 20:25:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 20:25:25,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:25,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:25,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-12 20:25:25,354 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:25,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:25,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1013602080, now seen corresponding path program 1 times [2024-10-12 20:25:25,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:25,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152972074] [2024-10-12 20:25:25,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:25,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:25,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:25,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152972074] [2024-10-12 20:25:25,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152972074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:25,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:25,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:25,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776263243] [2024-10-12 20:25:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:25,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:25:25,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:25,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:25:25,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:25:25,527 INFO L87 Difference]: Start difference. First operand 20604 states and 28192 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:26,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:26,308 INFO L93 Difference]: Finished difference Result 27754 states and 37975 transitions. [2024-10-12 20:25:26,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:25:26,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-12 20:25:26,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:26,399 INFO L225 Difference]: With dead ends: 27754 [2024-10-12 20:25:26,399 INFO L226 Difference]: Without dead ends: 27377 [2024-10-12 20:25:26,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:25:26,404 INFO L432 NwaCegarLoop]: 518 mSDtfsCounter, 2777 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2777 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:26,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2777 Valid, 2080 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:25:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27377 states. [2024-10-12 20:25:26,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27377 to 20597. [2024-10-12 20:25:26,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20597 states, 20596 states have (on average 1.3682268401631386) internal successors, (28180), 20596 states have internal predecessors, (28180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20597 states to 20597 states and 28180 transitions. [2024-10-12 20:25:26,590 INFO L78 Accepts]: Start accepts. Automaton has 20597 states and 28180 transitions. Word has length 89 [2024-10-12 20:25:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:26,591 INFO L471 AbstractCegarLoop]: Abstraction has 20597 states and 28180 transitions. [2024-10-12 20:25:26,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 20597 states and 28180 transitions. [2024-10-12 20:25:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 20:25:26,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:26,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:26,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-12 20:25:26,600 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:26,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:26,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1068890109, now seen corresponding path program 1 times [2024-10-12 20:25:26,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:26,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761258132] [2024-10-12 20:25:26,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:26,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:26,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761258132] [2024-10-12 20:25:26,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761258132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:26,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:26,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:25:26,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156637569] [2024-10-12 20:25:26,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:26,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:25:26,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:26,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:25:26,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:25:26,955 INFO L87 Difference]: Start difference. First operand 20597 states and 28180 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:27,632 INFO L93 Difference]: Finished difference Result 33419 states and 46029 transitions. [2024-10-12 20:25:27,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:25:27,632 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-12 20:25:27,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:27,665 INFO L225 Difference]: With dead ends: 33419 [2024-10-12 20:25:27,666 INFO L226 Difference]: Without dead ends: 32353 [2024-10-12 20:25:27,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:25:27,675 INFO L432 NwaCegarLoop]: 748 mSDtfsCounter, 4215 mSDsluCounter, 3728 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4215 SdHoareTripleChecker+Valid, 4476 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:27,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4215 Valid, 4476 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:25:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32353 states. [2024-10-12 20:25:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32353 to 20581. [2024-10-12 20:25:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20581 states, 20580 states have (on average 1.3682215743440234) internal successors, (28158), 20580 states have internal predecessors, (28158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20581 states to 20581 states and 28158 transitions. [2024-10-12 20:25:27,905 INFO L78 Accepts]: Start accepts. Automaton has 20581 states and 28158 transitions. Word has length 90 [2024-10-12 20:25:27,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:27,905 INFO L471 AbstractCegarLoop]: Abstraction has 20581 states and 28158 transitions. [2024-10-12 20:25:27,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 20581 states and 28158 transitions. [2024-10-12 20:25:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 20:25:27,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:27,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:27,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-12 20:25:27,915 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:27,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:27,915 INFO L85 PathProgramCache]: Analyzing trace with hash 746063949, now seen corresponding path program 1 times [2024-10-12 20:25:27,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:27,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691825292] [2024-10-12 20:25:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:27,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:28,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:28,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691825292] [2024-10-12 20:25:28,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691825292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:28,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:28,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:25:28,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498102387] [2024-10-12 20:25:28,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:28,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:25:28,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:28,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:25:28,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:28,031 INFO L87 Difference]: Start difference. First operand 20581 states and 28158 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:28,615 INFO L93 Difference]: Finished difference Result 41648 states and 57338 transitions. [2024-10-12 20:25:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:25:28,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-12 20:25:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:28,658 INFO L225 Difference]: With dead ends: 41648 [2024-10-12 20:25:28,658 INFO L226 Difference]: Without dead ends: 40943 [2024-10-12 20:25:28,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:25:28,673 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 3400 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3400 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:28,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3400 Valid, 1201 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:25:28,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40943 states. [2024-10-12 20:25:28,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40943 to 20565. [2024-10-12 20:25:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20565 states, 20564 states have (on average 1.3681676716592102) internal successors, (28135), 20564 states have internal predecessors, (28135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20565 states to 20565 states and 28135 transitions. [2024-10-12 20:25:29,014 INFO L78 Accepts]: Start accepts. Automaton has 20565 states and 28135 transitions. Word has length 90 [2024-10-12 20:25:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:29,014 INFO L471 AbstractCegarLoop]: Abstraction has 20565 states and 28135 transitions. [2024-10-12 20:25:29,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 20565 states and 28135 transitions. [2024-10-12 20:25:29,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 20:25:29,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:29,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:29,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-10-12 20:25:29,024 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:29,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:29,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1432446, now seen corresponding path program 1 times [2024-10-12 20:25:29,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:29,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123798451] [2024-10-12 20:25:29,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:29,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:29,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123798451] [2024-10-12 20:25:29,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123798451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:29,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:29,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-12 20:25:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330566497] [2024-10-12 20:25:29,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:29,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 20:25:29,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:29,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 20:25:29,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:25:29,505 INFO L87 Difference]: Start difference. First operand 20565 states and 28135 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:30,377 INFO L93 Difference]: Finished difference Result 67682 states and 93704 transitions. [2024-10-12 20:25:30,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 20:25:30,378 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-12 20:25:30,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:30,453 INFO L225 Difference]: With dead ends: 67682 [2024-10-12 20:25:30,453 INFO L226 Difference]: Without dead ends: 66513 [2024-10-12 20:25:30,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2024-10-12 20:25:30,478 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 4521 mSDsluCounter, 4759 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4521 SdHoareTripleChecker+Valid, 5458 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:30,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4521 Valid, 5458 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:25:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66513 states. [2024-10-12 20:25:30,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66513 to 20446. [2024-10-12 20:25:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20446 states, 20445 states have (on average 1.3684519442406455) internal successors, (27978), 20445 states have internal predecessors, (27978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20446 states to 20446 states and 27978 transitions. [2024-10-12 20:25:30,916 INFO L78 Accepts]: Start accepts. Automaton has 20446 states and 27978 transitions. Word has length 90 [2024-10-12 20:25:30,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:30,916 INFO L471 AbstractCegarLoop]: Abstraction has 20446 states and 27978 transitions. [2024-10-12 20:25:30,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 20446 states and 27978 transitions. [2024-10-12 20:25:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 20:25:30,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:30,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:30,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-10-12 20:25:30,925 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:30,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:30,925 INFO L85 PathProgramCache]: Analyzing trace with hash -502364313, now seen corresponding path program 1 times [2024-10-12 20:25:30,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:30,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027533200] [2024-10-12 20:25:30,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:30,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:31,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027533200] [2024-10-12 20:25:31,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027533200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:31,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:31,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-12 20:25:31,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031939449] [2024-10-12 20:25:31,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:31,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 20:25:31,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:31,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 20:25:31,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:25:31,612 INFO L87 Difference]: Start difference. First operand 20446 states and 27978 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:32,517 INFO L93 Difference]: Finished difference Result 69419 states and 96200 transitions. [2024-10-12 20:25:32,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 20:25:32,518 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-12 20:25:32,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:32,591 INFO L225 Difference]: With dead ends: 69419 [2024-10-12 20:25:32,591 INFO L226 Difference]: Without dead ends: 66118 [2024-10-12 20:25:32,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2024-10-12 20:25:32,614 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 5005 mSDsluCounter, 4864 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5005 SdHoareTripleChecker+Valid, 5525 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:32,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5005 Valid, 5525 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:25:32,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66118 states. [2024-10-12 20:25:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66118 to 20186. [2024-10-12 20:25:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20186 states, 20185 states have (on average 1.3706217488233836) internal successors, (27666), 20185 states have internal predecessors, (27666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:33,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 27666 transitions. [2024-10-12 20:25:33,054 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 27666 transitions. Word has length 90 [2024-10-12 20:25:33,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:33,054 INFO L471 AbstractCegarLoop]: Abstraction has 20186 states and 27666 transitions. [2024-10-12 20:25:33,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 27666 transitions. [2024-10-12 20:25:33,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 20:25:33,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:33,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:33,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-10-12 20:25:33,062 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:33,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:33,063 INFO L85 PathProgramCache]: Analyzing trace with hash -731864650, now seen corresponding path program 1 times [2024-10-12 20:25:33,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:33,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75715998] [2024-10-12 20:25:33,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:33,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:33,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:33,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75715998] [2024-10-12 20:25:33,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75715998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:33,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:33,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:25:33,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037720458] [2024-10-12 20:25:33,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:33,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:25:33,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:33,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:25:33,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:25:33,417 INFO L87 Difference]: Start difference. First operand 20186 states and 27666 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:34,033 INFO L93 Difference]: Finished difference Result 31894 states and 43931 transitions. [2024-10-12 20:25:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:25:34,033 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-12 20:25:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:34,066 INFO L225 Difference]: With dead ends: 31894 [2024-10-12 20:25:34,066 INFO L226 Difference]: Without dead ends: 31700 [2024-10-12 20:25:34,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2024-10-12 20:25:34,078 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 4202 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4202 SdHoareTripleChecker+Valid, 3135 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:34,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4202 Valid, 3135 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:25:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31700 states. [2024-10-12 20:25:34,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31700 to 20150. [2024-10-12 20:25:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20150 states, 20149 states have (on average 1.3708868926497593) internal successors, (27622), 20149 states have internal predecessors, (27622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20150 states to 20150 states and 27622 transitions. [2024-10-12 20:25:34,314 INFO L78 Accepts]: Start accepts. Automaton has 20150 states and 27622 transitions. Word has length 90 [2024-10-12 20:25:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:34,314 INFO L471 AbstractCegarLoop]: Abstraction has 20150 states and 27622 transitions. [2024-10-12 20:25:34,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 20150 states and 27622 transitions. [2024-10-12 20:25:34,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 20:25:34,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:34,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:34,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-10-12 20:25:34,324 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:34,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:34,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1915217273, now seen corresponding path program 1 times [2024-10-12 20:25:34,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:34,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137830374] [2024-10-12 20:25:34,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:34,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:34,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:34,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137830374] [2024-10-12 20:25:34,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137830374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:34,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:34,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:34,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3254484] [2024-10-12 20:25:34,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:34,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:34,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:34,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:34,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:34,384 INFO L87 Difference]: Start difference. First operand 20150 states and 27622 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:34,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:34,460 INFO L93 Difference]: Finished difference Result 27012 states and 37092 transitions. [2024-10-12 20:25:34,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:34,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-12 20:25:34,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:34,478 INFO L225 Difference]: With dead ends: 27012 [2024-10-12 20:25:34,478 INFO L226 Difference]: Without dead ends: 16585 [2024-10-12 20:25:34,488 INFO L431 NwaCegarLoop]: 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 [2024-10-12 20:25:34,488 INFO L432 NwaCegarLoop]: 822 mSDtfsCounter, 363 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:34,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1247 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16585 states. [2024-10-12 20:25:34,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16585 to 12925. [2024-10-12 20:25:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12925 states, 12924 states have (on average 1.3415351284432064) internal successors, (17338), 12924 states have internal predecessors, (17338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12925 states to 12925 states and 17338 transitions. [2024-10-12 20:25:34,630 INFO L78 Accepts]: Start accepts. Automaton has 12925 states and 17338 transitions. Word has length 91 [2024-10-12 20:25:34,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:34,631 INFO L471 AbstractCegarLoop]: Abstraction has 12925 states and 17338 transitions. [2024-10-12 20:25:34,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 12925 states and 17338 transitions. [2024-10-12 20:25:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 20:25:34,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:34,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:34,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-10-12 20:25:34,640 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:34,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash -13038917, now seen corresponding path program 1 times [2024-10-12 20:25:34,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:34,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314230661] [2024-10-12 20:25:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:34,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314230661] [2024-10-12 20:25:34,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314230661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:34,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:34,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:25:34,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16764732] [2024-10-12 20:25:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:34,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:25:34,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:34,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:25:34,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:25:34,979 INFO L87 Difference]: Start difference. First operand 12925 states and 17338 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:36,136 INFO L93 Difference]: Finished difference Result 35141 states and 47663 transitions. [2024-10-12 20:25:36,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-12 20:25:36,137 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-12 20:25:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:36,176 INFO L225 Difference]: With dead ends: 35141 [2024-10-12 20:25:36,177 INFO L226 Difference]: Without dead ends: 35063 [2024-10-12 20:25:36,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2024-10-12 20:25:36,190 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 5961 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5961 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:36,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5961 Valid, 2048 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:25:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35063 states. [2024-10-12 20:25:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35063 to 12929. [2024-10-12 20:25:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12929 states, 12928 states have (on average 1.3414294554455446) internal successors, (17342), 12928 states have internal predecessors, (17342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:36,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12929 states to 12929 states and 17342 transitions. [2024-10-12 20:25:36,465 INFO L78 Accepts]: Start accepts. Automaton has 12929 states and 17342 transitions. Word has length 93 [2024-10-12 20:25:36,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:36,466 INFO L471 AbstractCegarLoop]: Abstraction has 12929 states and 17342 transitions. [2024-10-12 20:25:36,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:36,466 INFO L276 IsEmpty]: Start isEmpty. Operand 12929 states and 17342 transitions. [2024-10-12 20:25:36,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 20:25:36,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:36,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:36,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-10-12 20:25:36,475 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:36,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:36,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1149030905, now seen corresponding path program 1 times [2024-10-12 20:25:36,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:36,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659757840] [2024-10-12 20:25:36,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:36,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:36,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:36,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659757840] [2024-10-12 20:25:36,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659757840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:36,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:36,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:36,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773027327] [2024-10-12 20:25:36,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:36,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:25:36,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:36,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:25:36,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:25:36,671 INFO L87 Difference]: Start difference. First operand 12929 states and 17342 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:37,311 INFO L93 Difference]: Finished difference Result 16931 states and 22779 transitions. [2024-10-12 20:25:37,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:25:37,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-12 20:25:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:37,329 INFO L225 Difference]: With dead ends: 16931 [2024-10-12 20:25:37,329 INFO L226 Difference]: Without dead ends: 16855 [2024-10-12 20:25:37,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:25:37,335 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 2376 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:37,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2376 Valid, 1682 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:25:37,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16855 states. [2024-10-12 20:25:37,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16855 to 12929. [2024-10-12 20:25:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12929 states, 12928 states have (on average 1.341352103960396) internal successors, (17341), 12928 states have internal predecessors, (17341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12929 states to 12929 states and 17341 transitions. [2024-10-12 20:25:37,565 INFO L78 Accepts]: Start accepts. Automaton has 12929 states and 17341 transitions. Word has length 93 [2024-10-12 20:25:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:37,565 INFO L471 AbstractCegarLoop]: Abstraction has 12929 states and 17341 transitions. [2024-10-12 20:25:37,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 12929 states and 17341 transitions. [2024-10-12 20:25:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:25:37,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:37,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:37,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-10-12 20:25:37,575 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:37,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:37,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1435725602, now seen corresponding path program 1 times [2024-10-12 20:25:37,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:37,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902234450] [2024-10-12 20:25:37,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:37,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:37,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:37,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902234450] [2024-10-12 20:25:37,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902234450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:37,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:37,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:37,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160416726] [2024-10-12 20:25:37,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:37,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:25:37,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:37,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:25:37,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:25:37,766 INFO L87 Difference]: Start difference. First operand 12929 states and 17341 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:38,404 INFO L93 Difference]: Finished difference Result 16933 states and 22780 transitions. [2024-10-12 20:25:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:25:38,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:25:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:38,421 INFO L225 Difference]: With dead ends: 16933 [2024-10-12 20:25:38,421 INFO L226 Difference]: Without dead ends: 16855 [2024-10-12 20:25:38,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:25:38,427 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 2359 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2359 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:38,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2359 Valid, 1681 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:25:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16855 states. [2024-10-12 20:25:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16855 to 12925. [2024-10-12 20:25:38,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12925 states, 12924 states have (on average 1.3413803775920767) internal successors, (17336), 12924 states have internal predecessors, (17336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12925 states to 12925 states and 17336 transitions. [2024-10-12 20:25:38,560 INFO L78 Accepts]: Start accepts. Automaton has 12925 states and 17336 transitions. Word has length 94 [2024-10-12 20:25:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:38,560 INFO L471 AbstractCegarLoop]: Abstraction has 12925 states and 17336 transitions. [2024-10-12 20:25:38,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand 12925 states and 17336 transitions. [2024-10-12 20:25:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:25:38,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:38,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:38,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-10-12 20:25:38,571 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:38,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:38,571 INFO L85 PathProgramCache]: Analyzing trace with hash 498352116, now seen corresponding path program 1 times [2024-10-12 20:25:38,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:38,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195568255] [2024-10-12 20:25:38,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:38,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:38,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:38,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195568255] [2024-10-12 20:25:38,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195568255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:38,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:38,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:25:38,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144516711] [2024-10-12 20:25:38,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:38,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:25:38,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:38,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:25:38,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:25:38,981 INFO L87 Difference]: Start difference. First operand 12925 states and 17336 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:39,681 INFO L93 Difference]: Finished difference Result 19816 states and 26846 transitions. [2024-10-12 20:25:39,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:25:39,682 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:25:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:39,702 INFO L225 Difference]: With dead ends: 19816 [2024-10-12 20:25:39,702 INFO L226 Difference]: Without dead ends: 19688 [2024-10-12 20:25:39,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:25:39,709 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 2321 mSDsluCounter, 2994 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2321 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:39,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2321 Valid, 3520 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:25:39,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19688 states. [2024-10-12 20:25:39,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19688 to 12873. [2024-10-12 20:25:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12873 states, 12872 states have (on average 1.341594157862026) internal successors, (17269), 12872 states have internal predecessors, (17269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12873 states to 12873 states and 17269 transitions. [2024-10-12 20:25:39,859 INFO L78 Accepts]: Start accepts. Automaton has 12873 states and 17269 transitions. Word has length 96 [2024-10-12 20:25:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:39,859 INFO L471 AbstractCegarLoop]: Abstraction has 12873 states and 17269 transitions. [2024-10-12 20:25:39,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand 12873 states and 17269 transitions. [2024-10-12 20:25:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:25:39,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:39,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:25:39,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-10-12 20:25:39,872 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-12 20:25:39,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:39,872 INFO L85 PathProgramCache]: Analyzing trace with hash 849601314, now seen corresponding path program 1 times [2024-10-12 20:25:39,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:39,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084304841] [2024-10-12 20:25:39,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:39,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:39,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:39,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084304841] [2024-10-12 20:25:39,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084304841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:39,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:39,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095505615] [2024-10-12 20:25:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:39,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:25:39,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:39,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:25:39,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:39,977 INFO L87 Difference]: Start difference. First operand 12873 states and 17269 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:25:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:40,182 INFO L93 Difference]: Finished difference Result 41937 states and 57910 transitions. [2024-10-12 20:25:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:25:40,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-10-12 20:25:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:40,220 INFO L225 Difference]: With dead ends: 41937 [2024-10-12 20:25:40,220 INFO L226 Difference]: Without dead ends: 31945 [2024-10-12 20:25:40,236 INFO L431 NwaCegarLoop]: 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 [2024-10-12 20:25:40,237 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 3482 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3482 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:40,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3482 Valid, 2130 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:25:40,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31945 states.