./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.3.ufo.BOUNDED-6.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.3.ufo.BOUNDED-6.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 8903dcb91a7500453f98b743541ef164d589c2f5828e51ac11fb5ea90b79c3dd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:26:16,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:26:16,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:26:16,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:26:16,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:26:16,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:26:16,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:26:16,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:26:16,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:26:16,272 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:26:16,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:26:16,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:26:16,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:26:16,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:26:16,276 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:26:16,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:26:16,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:26:16,277 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:26:16,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:26:16,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:26:16,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:26:16,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:26:16,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:26:16,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:26:16,280 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:26:16,282 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:26:16,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:26:16,283 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:26:16,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:26:16,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:26:16,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:26:16,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:26:16,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:26:16,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:26:16,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:26:16,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:26:16,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:26:16,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:26:16,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:26:16,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:26:16,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:26:16,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:26:16,286 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 -> 8903dcb91a7500453f98b743541ef164d589c2f5828e51ac11fb5ea90b79c3dd [2024-10-12 20:26:16,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:26:16,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:26:16,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:26:16,523 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:26:16,524 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:26:16,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-12 20:26:17,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:26:18,077 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:26:18,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-12 20:26:18,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a740489d/6860d0048d3e4e9fb4b24ce43d94b36c/FLAG19f71150e [2024-10-12 20:26:18,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a740489d/6860d0048d3e4e9fb4b24ce43d94b36c [2024-10-12 20:26:18,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:26:18,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:26:18,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:26:18,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:26:18,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:26:18,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:26:18" (1/1) ... [2024-10-12 20:26:18,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c522ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:18, skipping insertion in model container [2024-10-12 20:26:18,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:26:18" (1/1) ... [2024-10-12 20:26:18,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:26:18,752 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7543,7556] [2024-10-12 20:26:18,778 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10430,10443] [2024-10-12 20:26:18,805 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11521,11534] [2024-10-12 20:26:18,812 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12127,12140] [2024-10-12 20:26:18,828 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13546,13559] [2024-10-12 20:26:18,831 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14152,14165] [2024-10-12 20:26:18,835 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15123,15136] [2024-10-12 20:26:18,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:26:18,875 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:26:18,920 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7543,7556] [2024-10-12 20:26:18,935 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10430,10443] [2024-10-12 20:26:18,945 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11521,11534] [2024-10-12 20:26:18,952 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12127,12140] [2024-10-12 20:26:18,962 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13546,13559] [2024-10-12 20:26:18,967 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14152,14165] [2024-10-12 20:26:18,974 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15123,15136] [2024-10-12 20:26:19,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:26:19,027 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:26:19,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:19 WrapperNode [2024-10-12 20:26:19,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:26:19,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:26:19,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:26:19,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:26:19,036 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:26:19" (1/1) ... [2024-10-12 20:26:19,047 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:26:19" (1/1) ... [2024-10-12 20:26:19,098 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1104 [2024-10-12 20:26:19,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:26:19,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:26:19,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:26:19,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:26:19,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:19" (1/1) ... [2024-10-12 20:26:19,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:19" (1/1) ... [2024-10-12 20:26:19,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:19" (1/1) ... [2024-10-12 20:26:19,139 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:26:19,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:19" (1/1) ... [2024-10-12 20:26:19,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:19" (1/1) ... [2024-10-12 20:26:19,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:19" (1/1) ... [2024-10-12 20:26:19,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:19" (1/1) ... [2024-10-12 20:26:19,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:19" (1/1) ... [2024-10-12 20:26:19,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:19" (1/1) ... [2024-10-12 20:26:19,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:26:19,175 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:26:19,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:26:19,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:26:19,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:19" (1/1) ... [2024-10-12 20:26:19,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:26:19,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:26:19,218 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:26:19,220 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:26:19,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:26:19,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:26:19,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:26:19,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:26:19,357 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:26:19,359 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:26:20,055 INFO L? ?]: Removed 178 outVars from TransFormulas that were not future-live. [2024-10-12 20:26:20,055 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:26:20,092 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:26:20,093 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:26:20,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:26:20 BoogieIcfgContainer [2024-10-12 20:26:20,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:26:20,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:26:20,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:26:20,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:26:20,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:26:18" (1/3) ... [2024-10-12 20:26:20,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a3dfd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:26:20, skipping insertion in model container [2024-10-12 20:26:20,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:19" (2/3) ... [2024-10-12 20:26:20,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a3dfd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:26:20, skipping insertion in model container [2024-10-12 20:26:20,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:26:20" (3/3) ... [2024-10-12 20:26:20,103 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-12 20:26:20,120 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:26:20,120 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-12 20:26:20,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:26:20,199 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;@54399c76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:26:20,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-12 20:26:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 197 states have (on average 1.83248730964467) internal successors, (361), 204 states have internal predecessors, (361), 0 states have call successors, (0), 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:26:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 20:26:20,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:20,218 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] [2024-10-12 20:26:20,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:20,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:20,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1273195572, now seen corresponding path program 1 times [2024-10-12 20:26:20,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:20,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077956600] [2024-10-12 20:26:20,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:20,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:20,680 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:26:20,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:20,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077956600] [2024-10-12 20:26:20,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077956600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:20,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:20,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:26:20,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811593790] [2024-10-12 20:26:20,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:20,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:26:20,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:20,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:26:20,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:26:20,713 INFO L87 Difference]: Start difference. First operand has 205 states, 197 states have (on average 1.83248730964467) internal successors, (361), 204 states have internal predecessors, (361), 0 states have call successors, (0), 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 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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:26:20,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:20,939 INFO L93 Difference]: Finished difference Result 334 states and 565 transitions. [2024-10-12 20:26:20,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:26:20,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-12 20:26:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:20,952 INFO L225 Difference]: With dead ends: 334 [2024-10-12 20:26:20,952 INFO L226 Difference]: Without dead ends: 183 [2024-10-12 20:26:20,956 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:26:20,961 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 854 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:20,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 239 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:26:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-12 20:26:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-10-12 20:26:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 176 states have (on average 1.2727272727272727) internal successors, (224), 182 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 224 transitions. [2024-10-12 20:26:21,012 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 224 transitions. Word has length 46 [2024-10-12 20:26:21,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:21,012 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 224 transitions. [2024-10-12 20:26:21,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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:26:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 224 transitions. [2024-10-12 20:26:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 20:26:21,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:21,014 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] [2024-10-12 20:26:21,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:26:21,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:21,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1862883361, now seen corresponding path program 1 times [2024-10-12 20:26:21,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:21,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746698814] [2024-10-12 20:26:21,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:21,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:21,218 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:26:21,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:21,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746698814] [2024-10-12 20:26:21,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746698814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:21,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:21,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:26:21,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544517012] [2024-10-12 20:26:21,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:21,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:26:21,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:21,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:26:21,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:26:21,224 INFO L87 Difference]: Start difference. First operand 183 states and 224 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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:26:21,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:21,347 INFO L93 Difference]: Finished difference Result 306 states and 385 transitions. [2024-10-12 20:26:21,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:26:21,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-10-12 20:26:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:21,350 INFO L225 Difference]: With dead ends: 306 [2024-10-12 20:26:21,350 INFO L226 Difference]: Without dead ends: 164 [2024-10-12 20:26:21,350 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:26:21,351 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 578 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:21,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 125 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:26:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-12 20:26:21,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-10-12 20:26:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 157 states have (on average 1.286624203821656) internal successors, (202), 163 states have internal predecessors, (202), 0 states have call successors, (0), 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:26:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 202 transitions. [2024-10-12 20:26:21,359 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 202 transitions. Word has length 47 [2024-10-12 20:26:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:21,359 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 202 transitions. [2024-10-12 20:26:21,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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:26:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2024-10-12 20:26:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 20:26:21,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:21,361 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] [2024-10-12 20:26:21,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:26:21,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:21,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash 135868934, now seen corresponding path program 1 times [2024-10-12 20:26:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:21,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459302193] [2024-10-12 20:26:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:21,481 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:26:21,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:21,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459302193] [2024-10-12 20:26:21,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459302193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:21,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:21,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:26:21,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129389225] [2024-10-12 20:26:21,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:21,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:26:21,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:21,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:26:21,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:26:21,485 INFO L87 Difference]: Start difference. First operand 164 states and 202 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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:26:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:21,581 INFO L93 Difference]: Finished difference Result 287 states and 362 transitions. [2024-10-12 20:26:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:26:21,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-12 20:26:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:21,583 INFO L225 Difference]: With dead ends: 287 [2024-10-12 20:26:21,583 INFO L226 Difference]: Without dead ends: 156 [2024-10-12 20:26:21,584 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:26:21,584 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 536 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:21,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 124 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:26:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-12 20:26:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-10-12 20:26:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 155 states have internal predecessors, (192), 0 states have call successors, (0), 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:26:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 192 transitions. [2024-10-12 20:26:21,594 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 192 transitions. Word has length 48 [2024-10-12 20:26:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:21,595 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 192 transitions. [2024-10-12 20:26:21,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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:26:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 192 transitions. [2024-10-12 20:26:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:26:21,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:21,599 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] [2024-10-12 20:26:21,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:26:21,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:21,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:21,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1731915121, now seen corresponding path program 1 times [2024-10-12 20:26:21,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:21,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3960087] [2024-10-12 20:26:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:21,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:21,902 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:26:21,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:21,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3960087] [2024-10-12 20:26:21,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3960087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:21,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:21,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:26:21,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941741255] [2024-10-12 20:26:21,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:21,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:26:21,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:21,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:26:21,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:26:21,906 INFO L87 Difference]: Start difference. First operand 156 states and 192 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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:26:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:22,258 INFO L93 Difference]: Finished difference Result 243 states and 302 transitions. [2024-10-12 20:26:22,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:26:22,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-12 20:26:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:22,261 INFO L225 Difference]: With dead ends: 243 [2024-10-12 20:26:22,261 INFO L226 Difference]: Without dead ends: 238 [2024-10-12 20:26:22,261 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:26:22,262 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 583 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:22,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 611 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:26:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-12 20:26:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 156. [2024-10-12 20:26:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 155 states have internal predecessors, (191), 0 states have call successors, (0), 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:26:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 191 transitions. [2024-10-12 20:26:22,276 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 191 transitions. Word has length 49 [2024-10-12 20:26:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:22,277 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 191 transitions. [2024-10-12 20:26:22,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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:26:22,277 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 191 transitions. [2024-10-12 20:26:22,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:26:22,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:22,278 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] [2024-10-12 20:26:22,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:26:22,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:22,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:22,279 INFO L85 PathProgramCache]: Analyzing trace with hash -650855073, now seen corresponding path program 1 times [2024-10-12 20:26:22,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:22,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612533098] [2024-10-12 20:26:22,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:22,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:22,483 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:26:22,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:22,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612533098] [2024-10-12 20:26:22,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612533098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:22,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:22,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:26:22,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603530900] [2024-10-12 20:26:22,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:22,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:26:22,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:22,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:26:22,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:26:22,485 INFO L87 Difference]: Start difference. First operand 156 states and 191 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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:26:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:22,784 INFO L93 Difference]: Finished difference Result 302 states and 385 transitions. [2024-10-12 20:26:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:26:22,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-12 20:26:22,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:22,786 INFO L225 Difference]: With dead ends: 302 [2024-10-12 20:26:22,786 INFO L226 Difference]: Without dead ends: 242 [2024-10-12 20:26:22,787 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:26:22,789 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 393 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:22,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 628 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:26:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-12 20:26:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 156. [2024-10-12 20:26:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 155 states have internal predecessors, (190), 0 states have call successors, (0), 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:26:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 190 transitions. [2024-10-12 20:26:22,795 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 190 transitions. Word has length 49 [2024-10-12 20:26:22,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:22,800 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 190 transitions. [2024-10-12 20:26:22,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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:26:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 190 transitions. [2024-10-12 20:26:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:26:22,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:22,800 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] [2024-10-12 20:26:22,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:26:22,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:22,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:22,801 INFO L85 PathProgramCache]: Analyzing trace with hash 622927837, now seen corresponding path program 1 times [2024-10-12 20:26:22,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:22,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235137126] [2024-10-12 20:26:22,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:22,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:23,017 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:26:23,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:23,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235137126] [2024-10-12 20:26:23,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235137126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:23,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:23,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:26:23,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373977137] [2024-10-12 20:26:23,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:23,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:26:23,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:23,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:26:23,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:26:23,022 INFO L87 Difference]: Start difference. First operand 156 states and 190 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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:26:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:23,265 INFO L93 Difference]: Finished difference Result 311 states and 388 transitions. [2024-10-12 20:26:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:26:23,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-12 20:26:23,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:23,270 INFO L225 Difference]: With dead ends: 311 [2024-10-12 20:26:23,270 INFO L226 Difference]: Without dead ends: 228 [2024-10-12 20:26:23,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:26:23,271 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 521 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:23,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 509 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:26:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-12 20:26:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 156. [2024-10-12 20:26:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2684563758389262) internal successors, (189), 155 states have internal predecessors, (189), 0 states have call successors, (0), 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:26:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 189 transitions. [2024-10-12 20:26:23,289 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 189 transitions. Word has length 49 [2024-10-12 20:26:23,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:23,289 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 189 transitions. [2024-10-12 20:26:23,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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:26:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 189 transitions. [2024-10-12 20:26:23,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 20:26:23,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:23,290 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] [2024-10-12 20:26:23,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:26:23,291 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:23,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:23,291 INFO L85 PathProgramCache]: Analyzing trace with hash 359581070, now seen corresponding path program 1 times [2024-10-12 20:26:23,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:23,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654848118] [2024-10-12 20:26:23,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:23,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:23,885 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:26:23,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:23,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654848118] [2024-10-12 20:26:23,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654848118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:23,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:23,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:26:23,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706958989] [2024-10-12 20:26:23,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:23,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:26:23,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:23,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:26:23,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:26:23,888 INFO L87 Difference]: Start difference. First operand 156 states and 189 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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:26:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:24,504 INFO L93 Difference]: Finished difference Result 405 states and 518 transitions. [2024-10-12 20:26:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 20:26:24,505 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-12 20:26:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:24,506 INFO L225 Difference]: With dead ends: 405 [2024-10-12 20:26:24,506 INFO L226 Difference]: Without dead ends: 358 [2024-10-12 20:26:24,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:26:24,508 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 927 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:24,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 1333 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:26:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-12 20:26:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 152. [2024-10-12 20:26:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 146 states have (on average 1.2602739726027397) internal successors, (184), 151 states have internal predecessors, (184), 0 states have call successors, (0), 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:26:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 184 transitions. [2024-10-12 20:26:24,512 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 184 transitions. Word has length 51 [2024-10-12 20:26:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:24,512 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 184 transitions. [2024-10-12 20:26:24,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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:26:24,512 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 184 transitions. [2024-10-12 20:26:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 20:26:24,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:24,513 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] [2024-10-12 20:26:24,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:26:24,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:24,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:24,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1420936078, now seen corresponding path program 1 times [2024-10-12 20:26:24,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:24,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737180431] [2024-10-12 20:26:24,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:24,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:24,928 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:26:24,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:24,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737180431] [2024-10-12 20:26:24,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737180431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:24,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:24,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:26:24,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007746233] [2024-10-12 20:26:24,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:24,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:26:24,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:24,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:26:24,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:26:24,931 INFO L87 Difference]: Start difference. First operand 152 states and 184 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 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:26:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:25,347 INFO L93 Difference]: Finished difference Result 395 states and 511 transitions. [2024-10-12 20:26:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:26:25,348 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-12 20:26:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:25,349 INFO L225 Difference]: With dead ends: 395 [2024-10-12 20:26:25,349 INFO L226 Difference]: Without dead ends: 323 [2024-10-12 20:26:25,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-10-12 20:26:25,350 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 753 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:25,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1156 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:26:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-12 20:26:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 123. [2024-10-12 20:26:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.2605042016806722) internal successors, (150), 122 states have internal predecessors, (150), 0 states have call successors, (0), 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:26:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2024-10-12 20:26:25,355 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 51 [2024-10-12 20:26:25,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:25,355 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2024-10-12 20:26:25,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 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:26:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2024-10-12 20:26:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 20:26:25,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:25,356 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] [2024-10-12 20:26:25,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:26:25,357 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:25,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:25,357 INFO L85 PathProgramCache]: Analyzing trace with hash -83474213, now seen corresponding path program 1 times [2024-10-12 20:26:25,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:25,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317962562] [2024-10-12 20:26:25,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:25,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:26,093 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:26:26,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:26,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317962562] [2024-10-12 20:26:26,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317962562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:26,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:26,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-12 20:26:26,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165173930] [2024-10-12 20:26:26,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:26,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 20:26:26,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:26,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 20:26:26,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:26:26,095 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 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:26:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:27,032 INFO L93 Difference]: Finished difference Result 277 states and 351 transitions. [2024-10-12 20:26:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 20:26:27,032 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-12 20:26:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:27,033 INFO L225 Difference]: With dead ends: 277 [2024-10-12 20:26:27,033 INFO L226 Difference]: Without dead ends: 273 [2024-10-12 20:26:27,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 20:26:27,034 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 787 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:27,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 2064 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:26:27,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-12 20:26:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 133. [2024-10-12 20:26:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 129 states have (on average 1.2790697674418605) internal successors, (165), 132 states have internal predecessors, (165), 0 states have call successors, (0), 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:26:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 165 transitions. [2024-10-12 20:26:27,038 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 165 transitions. Word has length 51 [2024-10-12 20:26:27,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:27,039 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 165 transitions. [2024-10-12 20:26:27,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 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:26:27,039 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2024-10-12 20:26:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:26:27,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:27,043 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] [2024-10-12 20:26:27,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:26:27,044 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:27,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:27,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2094676409, now seen corresponding path program 1 times [2024-10-12 20:26:27,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:27,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428427229] [2024-10-12 20:26:27,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:27,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:27,717 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:26:27,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:27,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428427229] [2024-10-12 20:26:27,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428427229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:27,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:27,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-12 20:26:27,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141325561] [2024-10-12 20:26:27,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:27,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 20:26:27,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:27,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 20:26:27,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:26:27,719 INFO L87 Difference]: Start difference. First operand 133 states and 165 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:28,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:28,617 INFO L93 Difference]: Finished difference Result 265 states and 340 transitions. [2024-10-12 20:26:28,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 20:26:28,618 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-12 20:26:28,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:28,619 INFO L225 Difference]: With dead ends: 265 [2024-10-12 20:26:28,619 INFO L226 Difference]: Without dead ends: 249 [2024-10-12 20:26:28,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2024-10-12 20:26:28,620 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 934 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:28,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1757 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:26:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-12 20:26:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 125. [2024-10-12 20:26:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 124 states have internal predecessors, (154), 0 states have call successors, (0), 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:26:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2024-10-12 20:26:28,623 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 154 transitions. Word has length 52 [2024-10-12 20:26:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:28,623 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 154 transitions. [2024-10-12 20:26:28,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 154 transitions. [2024-10-12 20:26:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:26:28,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:28,624 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] [2024-10-12 20:26:28,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:26:28,624 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:28,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:28,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1872189982, now seen corresponding path program 1 times [2024-10-12 20:26:28,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:28,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852686306] [2024-10-12 20:26:28,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:28,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:28,804 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:26:28,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:28,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852686306] [2024-10-12 20:26:28,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852686306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:28,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:28,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:26:28,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521282698] [2024-10-12 20:26:28,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:28,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:26:28,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:28,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:26:28,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:26:28,806 INFO L87 Difference]: Start difference. First operand 125 states and 154 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:29,018 INFO L93 Difference]: Finished difference Result 196 states and 246 transitions. [2024-10-12 20:26:29,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:26:29,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-12 20:26:29,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:29,019 INFO L225 Difference]: With dead ends: 196 [2024-10-12 20:26:29,020 INFO L226 Difference]: Without dead ends: 189 [2024-10-12 20:26:29,020 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:26:29,020 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 435 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:29,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 467 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:26:29,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-12 20:26:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 125. [2024-10-12 20:26:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 124 states have internal predecessors, (153), 0 states have call successors, (0), 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:26:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2024-10-12 20:26:29,023 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 52 [2024-10-12 20:26:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:29,024 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2024-10-12 20:26:29,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2024-10-12 20:26:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:26:29,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26: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] [2024-10-12 20:26:29,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:26:29,025 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:29,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:29,025 INFO L85 PathProgramCache]: Analyzing trace with hash -873153248, now seen corresponding path program 1 times [2024-10-12 20:26:29,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:29,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395317565] [2024-10-12 20:26:29,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:29,184 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:26:29,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:29,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395317565] [2024-10-12 20:26:29,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395317565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:29,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:29,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:26:29,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296758543] [2024-10-12 20:26:29,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:29,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:26:29,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:29,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:26:29,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:26:29,186 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:29,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:29,467 INFO L93 Difference]: Finished difference Result 250 states and 322 transitions. [2024-10-12 20:26:29,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:26:29,468 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-12 20:26:29,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:29,469 INFO L225 Difference]: With dead ends: 250 [2024-10-12 20:26:29,469 INFO L226 Difference]: Without dead ends: 189 [2024-10-12 20:26:29,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:26:29,470 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 285 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:29,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 571 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:26:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-12 20:26:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 125. [2024-10-12 20:26:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 122 states have (on average 1.2377049180327868) internal successors, (151), 124 states have internal predecessors, (151), 0 states have call successors, (0), 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:26:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2024-10-12 20:26:29,472 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 52 [2024-10-12 20:26:29,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:29,473 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2024-10-12 20:26:29,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2024-10-12 20:26:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:26:29,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:29,474 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] [2024-10-12 20:26:29,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:26:29,474 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:29,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:29,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1832778738, now seen corresponding path program 1 times [2024-10-12 20:26:29,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:29,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437742082] [2024-10-12 20:26:29,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:29,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:30,098 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:26:30,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:30,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437742082] [2024-10-12 20:26:30,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437742082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:30,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:30,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-12 20:26:30,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849378595] [2024-10-12 20:26:30,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:30,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-12 20:26:30,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:30,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 20:26:30,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:26:30,100 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 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:26:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:30,890 INFO L93 Difference]: Finished difference Result 307 states and 396 transitions. [2024-10-12 20:26:30,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 20:26:30,891 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-12 20:26:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:30,892 INFO L225 Difference]: With dead ends: 307 [2024-10-12 20:26:30,892 INFO L226 Difference]: Without dead ends: 299 [2024-10-12 20:26:30,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2024-10-12 20:26:30,893 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 939 mSDsluCounter, 2083 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2343 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:30,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2343 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:26:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-12 20:26:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 125. [2024-10-12 20:26:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 122 states have (on average 1.2295081967213115) internal successors, (150), 124 states have internal predecessors, (150), 0 states have call successors, (0), 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:26:30,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 150 transitions. [2024-10-12 20:26:30,899 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 150 transitions. Word has length 54 [2024-10-12 20:26:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:30,900 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 150 transitions. [2024-10-12 20:26:30,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 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:26:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 150 transitions. [2024-10-12 20:26:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:26:30,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:30,902 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] [2024-10-12 20:26:30,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:26:30,903 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:30,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1645932369, now seen corresponding path program 1 times [2024-10-12 20:26:30,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:30,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31731749] [2024-10-12 20:26:30,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:30,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:31,467 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:26:31,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:31,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31731749] [2024-10-12 20:26:31,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31731749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:31,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:31,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-12 20:26:31,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344806354] [2024-10-12 20:26:31,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:31,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-12 20:26:31,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:31,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 20:26:31,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:26:31,469 INFO L87 Difference]: Start difference. First operand 125 states and 150 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 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:26:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:32,324 INFO L93 Difference]: Finished difference Result 311 states and 402 transitions. [2024-10-12 20:26:32,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 20:26:32,325 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-12 20:26:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:32,326 INFO L225 Difference]: With dead ends: 311 [2024-10-12 20:26:32,326 INFO L226 Difference]: Without dead ends: 305 [2024-10-12 20:26:32,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2024-10-12 20:26:32,326 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 571 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 2556 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:32,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 2556 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:26:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-12 20:26:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 131. [2024-10-12 20:26:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 128 states have (on average 1.234375) internal successors, (158), 130 states have internal predecessors, (158), 0 states have call successors, (0), 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:26:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 158 transitions. [2024-10-12 20:26:32,332 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 158 transitions. Word has length 54 [2024-10-12 20:26:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:32,333 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 158 transitions. [2024-10-12 20:26:32,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 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:26:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 158 transitions. [2024-10-12 20:26:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:26:32,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:32,333 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] [2024-10-12 20:26:32,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:26:32,333 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:32,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:32,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1729762893, now seen corresponding path program 1 times [2024-10-12 20:26:32,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:32,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066014827] [2024-10-12 20:26:32,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:32,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:32,724 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:26:32,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:32,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066014827] [2024-10-12 20:26:32,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066014827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:32,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:32,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:26:32,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604293130] [2024-10-12 20:26:32,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:32,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:26:32,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:32,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:26:32,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:26:32,726 INFO L87 Difference]: Start difference. First operand 131 states and 158 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:26:33,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:33,320 INFO L93 Difference]: Finished difference Result 287 states and 377 transitions. [2024-10-12 20:26:33,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 20:26:33,320 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-12 20:26:33,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:33,321 INFO L225 Difference]: With dead ends: 287 [2024-10-12 20:26:33,321 INFO L226 Difference]: Without dead ends: 281 [2024-10-12 20:26:33,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:26:33,322 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 684 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:33,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1266 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:26:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-12 20:26:33,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 119. [2024-10-12 20:26:33,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.2307692307692308) internal successors, (144), 118 states have internal predecessors, (144), 0 states have call successors, (0), 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:26:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 144 transitions. [2024-10-12 20:26:33,325 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 144 transitions. Word has length 55 [2024-10-12 20:26:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:33,325 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 144 transitions. [2024-10-12 20:26:33,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:26:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 144 transitions. [2024-10-12 20:26:33,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:26:33,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:33,326 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] [2024-10-12 20:26:33,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:26:33,326 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:33,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1973185107, now seen corresponding path program 1 times [2024-10-12 20:26:33,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:33,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677720547] [2024-10-12 20:26:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:33,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:26:33,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:33,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677720547] [2024-10-12 20:26:33,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677720547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:33,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:33,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:26:33,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549730772] [2024-10-12 20:26:33,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:33,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:26:33,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:33,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:26:33,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:26:33,688 INFO L87 Difference]: Start difference. First operand 119 states and 144 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:26:34,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:34,024 INFO L93 Difference]: Finished difference Result 175 states and 222 transitions. [2024-10-12 20:26:34,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:26:34,025 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-12 20:26:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:34,026 INFO L225 Difference]: With dead ends: 175 [2024-10-12 20:26:34,027 INFO L226 Difference]: Without dead ends: 163 [2024-10-12 20:26:34,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:26:34,027 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 414 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:34,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1109 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:26:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-12 20:26:34,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 101. [2024-10-12 20:26:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.25) internal successors, (125), 100 states have internal predecessors, (125), 0 states have call successors, (0), 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:26:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2024-10-12 20:26:34,032 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 55 [2024-10-12 20:26:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:34,032 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2024-10-12 20:26:34,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:26:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2024-10-12 20:26:34,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:26:34,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:34,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] [2024-10-12 20:26:34,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:26:34,033 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:34,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:34,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1767402819, now seen corresponding path program 1 times [2024-10-12 20:26:34,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:34,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704785058] [2024-10-12 20:26:34,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:34,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:34,100 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:26:34,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:34,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704785058] [2024-10-12 20:26:34,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704785058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:34,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:34,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:26:34,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502394289] [2024-10-12 20:26:34,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:34,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:26:34,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:34,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:26:34,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:26:34,102 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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:26:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:34,158 INFO L93 Difference]: Finished difference Result 359 states and 503 transitions. [2024-10-12 20:26:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:26:34,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2024-10-12 20:26:34,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:34,160 INFO L225 Difference]: With dead ends: 359 [2024-10-12 20:26:34,160 INFO L226 Difference]: Without dead ends: 316 [2024-10-12 20:26:34,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:26:34,161 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 479 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:34,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 597 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-12 20:26:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 142. [2024-10-12 20:26:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 0 states have call successors, (0), 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:26:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2024-10-12 20:26:34,165 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 72 [2024-10-12 20:26:34,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:34,166 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2024-10-12 20:26:34,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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:26:34,166 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2024-10-12 20:26:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:26:34,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:34,166 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:26:34,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:26:34,166 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:34,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:34,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1330307651, now seen corresponding path program 1 times [2024-10-12 20:26:34,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:34,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776624890] [2024-10-12 20:26:34,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:34,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:34,234 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:26:34,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:34,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776624890] [2024-10-12 20:26:34,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776624890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:34,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:34,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:26:34,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353266352] [2024-10-12 20:26:34,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:34,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:26:34,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:34,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:26:34,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:26:34,236 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:26:34,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:34,278 INFO L93 Difference]: Finished difference Result 437 states and 615 transitions. [2024-10-12 20:26:34,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:26:34,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:26:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:34,279 INFO L225 Difference]: With dead ends: 437 [2024-10-12 20:26:34,280 INFO L226 Difference]: Without dead ends: 353 [2024-10-12 20:26:34,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:26:34,280 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 280 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:34,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 417 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:34,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-12 20:26:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 224. [2024-10-12 20:26:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.3721973094170403) internal successors, (306), 223 states have internal predecessors, (306), 0 states have call successors, (0), 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:26:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 306 transitions. [2024-10-12 20:26:34,287 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 306 transitions. Word has length 74 [2024-10-12 20:26:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:34,288 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 306 transitions. [2024-10-12 20:26:34,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:26:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 306 transitions. [2024-10-12 20:26:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:26:34,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:34,289 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:26:34,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:26:34,289 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:34,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:34,289 INFO L85 PathProgramCache]: Analyzing trace with hash 794928439, now seen corresponding path program 1 times [2024-10-12 20:26:34,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:34,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026360037] [2024-10-12 20:26:34,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:34,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:34,358 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:26:34,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:34,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026360037] [2024-10-12 20:26:34,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026360037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:34,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:34,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:26:34,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104219728] [2024-10-12 20:26:34,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:34,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:26:34,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:34,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:26:34,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:26:34,361 INFO L87 Difference]: Start difference. First operand 224 states and 306 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:26:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:34,407 INFO L93 Difference]: Finished difference Result 519 states and 736 transitions. [2024-10-12 20:26:34,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:26:34,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:26:34,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:34,409 INFO L225 Difference]: With dead ends: 519 [2024-10-12 20:26:34,409 INFO L226 Difference]: Without dead ends: 435 [2024-10-12 20:26:34,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:26:34,410 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 290 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:34,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 428 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-10-12 20:26:34,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 347. [2024-10-12 20:26:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.407514450867052) internal successors, (487), 346 states have internal predecessors, (487), 0 states have call successors, (0), 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:26:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 487 transitions. [2024-10-12 20:26:34,419 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 487 transitions. Word has length 74 [2024-10-12 20:26:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:34,419 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 487 transitions. [2024-10-12 20:26:34,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:26:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 487 transitions. [2024-10-12 20:26:34,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:26:34,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:34,420 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:26:34,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:26:34,420 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:34,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:34,421 INFO L85 PathProgramCache]: Analyzing trace with hash 670344324, now seen corresponding path program 1 times [2024-10-12 20:26:34,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:34,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379214501] [2024-10-12 20:26:34,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:34,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:34,458 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:26:34,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:34,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379214501] [2024-10-12 20:26:34,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379214501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:34,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:34,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:26:34,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444598127] [2024-10-12 20:26:34,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:34,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:26:34,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:34,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:26:34,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:26:34,460 INFO L87 Difference]: Start difference. First operand 347 states and 487 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:26:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:34,475 INFO L93 Difference]: Finished difference Result 638 states and 913 transitions. [2024-10-12 20:26:34,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:26:34,476 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:26:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:34,477 INFO L225 Difference]: With dead ends: 638 [2024-10-12 20:26:34,477 INFO L226 Difference]: Without dead ends: 349 [2024-10-12 20:26:34,477 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:26:34,478 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:34,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 198 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:34,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-12 20:26:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2024-10-12 20:26:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.3959537572254335) internal successors, (483), 346 states have internal predecessors, (483), 0 states have call successors, (0), 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:26:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 483 transitions. [2024-10-12 20:26:34,484 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 483 transitions. Word has length 74 [2024-10-12 20:26:34,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:34,484 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 483 transitions. [2024-10-12 20:26:34,484 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:26:34,484 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 483 transitions. [2024-10-12 20:26:34,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:26:34,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:34,485 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:26:34,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:26:34,486 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:34,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash -98948669, now seen corresponding path program 1 times [2024-10-12 20:26:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731453715] [2024-10-12 20:26:34,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:34,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:34,532 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:26:34,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:34,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731453715] [2024-10-12 20:26:34,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731453715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:34,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:34,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:26:34,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67954090] [2024-10-12 20:26:34,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:34,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:26:34,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:34,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:26:34,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:26:34,536 INFO L87 Difference]: Start difference. First operand 347 states and 483 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:26:34,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:34,558 INFO L93 Difference]: Finished difference Result 880 states and 1250 transitions. [2024-10-12 20:26:34,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:26:34,559 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:26:34,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:34,561 INFO L225 Difference]: With dead ends: 880 [2024-10-12 20:26:34,561 INFO L226 Difference]: Without dead ends: 591 [2024-10-12 20:26:34,562 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:26:34,562 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 50 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:34,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 281 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:34,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-12 20:26:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2024-10-12 20:26:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.3843537414965987) internal successors, (814), 588 states have internal predecessors, (814), 0 states have call successors, (0), 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:26:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 814 transitions. [2024-10-12 20:26:34,576 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 814 transitions. Word has length 74 [2024-10-12 20:26:34,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:34,576 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 814 transitions. [2024-10-12 20:26:34,576 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:26:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 814 transitions. [2024-10-12 20:26:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:26:34,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:34,577 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:26:34,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:26:34,577 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:34,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:34,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2082611331, now seen corresponding path program 1 times [2024-10-12 20:26:34,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:34,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243237283] [2024-10-12 20:26:34,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:34,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:34,639 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:26:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:34,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243237283] [2024-10-12 20:26:34,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243237283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:34,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:34,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:26:34,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822247004] [2024-10-12 20:26:34,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:34,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:26:34,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:34,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:26:34,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:26:34,642 INFO L87 Difference]: Start difference. First operand 589 states and 814 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:26:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:34,686 INFO L93 Difference]: Finished difference Result 1050 states and 1466 transitions. [2024-10-12 20:26:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:26:34,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:26:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:34,689 INFO L225 Difference]: With dead ends: 1050 [2024-10-12 20:26:34,689 INFO L226 Difference]: Without dead ends: 897 [2024-10-12 20:26:34,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:26:34,691 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 284 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:34,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 451 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-10-12 20:26:34,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 740. [2024-10-12 20:26:34,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.3910690121786198) internal successors, (1028), 739 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1028 transitions. [2024-10-12 20:26:34,703 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1028 transitions. Word has length 74 [2024-10-12 20:26:34,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:34,703 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1028 transitions. [2024-10-12 20:26:34,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:26:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1028 transitions. [2024-10-12 20:26:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:26:34,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:34,704 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:26:34,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:26:34,704 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:34,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:34,705 INFO L85 PathProgramCache]: Analyzing trace with hash -753330043, now seen corresponding path program 1 times [2024-10-12 20:26:34,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:34,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423245435] [2024-10-12 20:26:34,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:34,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:34,763 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:26:34,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:34,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423245435] [2024-10-12 20:26:34,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423245435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:34,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:34,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:26:34,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888327288] [2024-10-12 20:26:34,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:34,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:26:34,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:34,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:26:34,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:26:34,765 INFO L87 Difference]: Start difference. First operand 740 states and 1028 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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:26:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:34,780 INFO L93 Difference]: Finished difference Result 1861 states and 2599 transitions. [2024-10-12 20:26:34,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:26:34,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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:26:34,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:34,784 INFO L225 Difference]: With dead ends: 1861 [2024-10-12 20:26:34,784 INFO L226 Difference]: Without dead ends: 1179 [2024-10-12 20:26:34,785 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:26:34,786 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 59 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:34,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 264 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2024-10-12 20:26:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1105. [2024-10-12 20:26:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1104 states have (on average 1.3804347826086956) internal successors, (1524), 1104 states have internal predecessors, (1524), 0 states have call successors, (0), 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:26:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1524 transitions. [2024-10-12 20:26:34,800 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1524 transitions. Word has length 75 [2024-10-12 20:26:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:34,801 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1524 transitions. [2024-10-12 20:26:34,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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:26:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1524 transitions. [2024-10-12 20:26:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:26:34,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:34,801 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:26:34,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:26:34,802 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:34,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:34,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1764053275, now seen corresponding path program 1 times [2024-10-12 20:26:34,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:34,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131026047] [2024-10-12 20:26:34,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:34,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:34,865 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:26:34,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:34,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131026047] [2024-10-12 20:26:34,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131026047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:34,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:34,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:26:34,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803885560] [2024-10-12 20:26:34,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:34,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:26:34,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:34,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:26:34,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:26:34,868 INFO L87 Difference]: Start difference. First operand 1105 states and 1524 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:26:34,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:34,886 INFO L93 Difference]: Finished difference Result 3091 states and 4259 transitions. [2024-10-12 20:26:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:26:34,886 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:26:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:34,891 INFO L225 Difference]: With dead ends: 3091 [2024-10-12 20:26:34,891 INFO L226 Difference]: Without dead ends: 2044 [2024-10-12 20:26:34,894 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:26:34,895 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 52 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:34,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 263 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2024-10-12 20:26:34,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1934. [2024-10-12 20:26:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1934 states, 1933 states have (on average 1.362648732540093) internal successors, (2634), 1933 states have internal predecessors, (2634), 0 states have call successors, (0), 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:26:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2634 transitions. [2024-10-12 20:26:34,926 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2634 transitions. Word has length 76 [2024-10-12 20:26:34,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:34,927 INFO L471 AbstractCegarLoop]: Abstraction has 1934 states and 2634 transitions. [2024-10-12 20:26:34,927 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:26:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2634 transitions. [2024-10-12 20:26:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:26:34,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:34,927 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:26:34,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:26:34,928 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:34,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:34,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1616355032, now seen corresponding path program 1 times [2024-10-12 20:26:34,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:34,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256238940] [2024-10-12 20:26:34,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:34,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:35,000 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:26:35,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:35,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256238940] [2024-10-12 20:26:35,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256238940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:35,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:35,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:26:35,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051967875] [2024-10-12 20:26:35,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:35,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:26:35,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:35,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:26:35,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:26:35,002 INFO L87 Difference]: Start difference. First operand 1934 states and 2634 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:26:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:35,026 INFO L93 Difference]: Finished difference Result 5470 states and 7400 transitions. [2024-10-12 20:26:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:26:35,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:26:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:35,035 INFO L225 Difference]: With dead ends: 5470 [2024-10-12 20:26:35,036 INFO L226 Difference]: Without dead ends: 3594 [2024-10-12 20:26:35,038 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:26:35,039 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 42 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 261 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:26:35,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 261 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2024-10-12 20:26:35,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3376. [2024-10-12 20:26:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3376 states, 3375 states have (on average 1.3342222222222222) internal successors, (4503), 3375 states have internal predecessors, (4503), 0 states have call successors, (0), 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:26:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 4503 transitions. [2024-10-12 20:26:35,096 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 4503 transitions. Word has length 77 [2024-10-12 20:26:35,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:35,096 INFO L471 AbstractCegarLoop]: Abstraction has 3376 states and 4503 transitions. [2024-10-12 20:26:35,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:26:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 4503 transitions. [2024-10-12 20:26:35,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 20:26:35,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:35,097 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:26:35,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 20:26:35,098 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:35,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:35,099 INFO L85 PathProgramCache]: Analyzing trace with hash -2121296140, now seen corresponding path program 1 times [2024-10-12 20:26:35,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:35,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88478877] [2024-10-12 20:26:35,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:35,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:35,276 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:26:35,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:35,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88478877] [2024-10-12 20:26:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88478877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:35,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:35,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:26:35,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342937557] [2024-10-12 20:26:35,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:35,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:26:35,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:35,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:26:35,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:26:35,278 INFO L87 Difference]: Start difference. First operand 3376 states and 4503 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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:26:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:35,320 INFO L93 Difference]: Finished difference Result 3474 states and 4632 transitions. [2024-10-12 20:26:35,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:26:35,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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:26:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:35,333 INFO L225 Difference]: With dead ends: 3474 [2024-10-12 20:26:35,334 INFO L226 Difference]: Without dead ends: 3472 [2024-10-12 20:26:35,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:26:35,336 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:35,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2024-10-12 20:26:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3472. [2024-10-12 20:26:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 3471 states have (on average 1.313454335926246) internal successors, (4559), 3471 states have internal predecessors, (4559), 0 states have call successors, (0), 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:26:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4559 transitions. [2024-10-12 20:26:35,408 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4559 transitions. Word has length 78 [2024-10-12 20:26:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:35,408 INFO L471 AbstractCegarLoop]: Abstraction has 3472 states and 4559 transitions. [2024-10-12 20:26:35,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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:26:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4559 transitions. [2024-10-12 20:26:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 20:26:35,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:35,409 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:26:35,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 20:26:35,410 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:35,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:35,411 INFO L85 PathProgramCache]: Analyzing trace with hash 305590840, now seen corresponding path program 1 times [2024-10-12 20:26:35,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:35,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751708915] [2024-10-12 20:26:35,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:35,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:35,452 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:26:35,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:35,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751708915] [2024-10-12 20:26:35,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751708915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:35,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:35,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:26:35,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440122451] [2024-10-12 20:26:35,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:35,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:26:35,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:35,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:26:35,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:26:35,454 INFO L87 Difference]: Start difference. First operand 3472 states and 4559 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:26:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:35,484 INFO L93 Difference]: Finished difference Result 7020 states and 9233 transitions. [2024-10-12 20:26:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:26:35,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:26:35,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:35,495 INFO L225 Difference]: With dead ends: 7020 [2024-10-12 20:26:35,495 INFO L226 Difference]: Without dead ends: 3606 [2024-10-12 20:26:35,499 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:26:35,500 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:35,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 214 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2024-10-12 20:26:35,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 3604. [2024-10-12 20:26:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3604 states, 3603 states have (on average 1.2930890924229808) internal successors, (4659), 3603 states have internal predecessors, (4659), 0 states have call successors, (0), 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:26:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 4659 transitions. [2024-10-12 20:26:35,581 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 4659 transitions. Word has length 78 [2024-10-12 20:26:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:35,582 INFO L471 AbstractCegarLoop]: Abstraction has 3604 states and 4659 transitions. [2024-10-12 20:26:35,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:26:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 4659 transitions. [2024-10-12 20:26:35,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 20:26:35,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:35,583 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:35,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 20:26:35,583 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:35,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:35,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1123966569, now seen corresponding path program 1 times [2024-10-12 20:26:35,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:35,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098708782] [2024-10-12 20:26:35,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:35,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:35,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:35,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098708782] [2024-10-12 20:26:35,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098708782] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:26:35,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227689780] [2024-10-12 20:26:35,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:35,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:35,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:26:35,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:26:35,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:26:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:35,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 20:26:35,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:26:36,636 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:36,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:26:37,702 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:37,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227689780] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:26:37,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:26:37,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2024-10-12 20:26:37,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433305420] [2024-10-12 20:26:37,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:26:37,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-12 20:26:37,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:37,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-12 20:26:37,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:26:37,704 INFO L87 Difference]: Start difference. First operand 3604 states and 4659 transitions. Second operand has 25 states, 25 states have (on average 10.04) internal successors, (251), 24 states have internal predecessors, (251), 0 states have call successors, (0), 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:26:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:39,088 INFO L93 Difference]: Finished difference Result 18276 states and 23511 transitions. [2024-10-12 20:26:39,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-12 20:26:39,089 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.04) internal successors, (251), 24 states have internal predecessors, (251), 0 states have call successors, (0), 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 100 [2024-10-12 20:26:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:39,121 INFO L225 Difference]: With dead ends: 18276 [2024-10-12 20:26:39,121 INFO L226 Difference]: Without dead ends: 14730 [2024-10-12 20:26:39,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=810, Invalid=2850, Unknown=0, NotChecked=0, Total=3660 [2024-10-12 20:26:39,130 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 2034 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:39,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2034 Valid, 972 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:26:39,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14730 states. [2024-10-12 20:26:39,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14730 to 7679. [2024-10-12 20:26:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7679 states, 7678 states have (on average 1.2862724667882262) internal successors, (9876), 7678 states have internal predecessors, (9876), 0 states have call successors, (0), 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:26:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7679 states to 7679 states and 9876 transitions. [2024-10-12 20:26:39,289 INFO L78 Accepts]: Start accepts. Automaton has 7679 states and 9876 transitions. Word has length 100 [2024-10-12 20:26:39,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:39,290 INFO L471 AbstractCegarLoop]: Abstraction has 7679 states and 9876 transitions. [2024-10-12 20:26:39,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.04) internal successors, (251), 24 states have internal predecessors, (251), 0 states have call successors, (0), 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:26:39,290 INFO L276 IsEmpty]: Start isEmpty. Operand 7679 states and 9876 transitions. [2024-10-12 20:26:39,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:26:39,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:39,292 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:39,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:26:39,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-12 20:26:39,497 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:39,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:39,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1838876044, now seen corresponding path program 1 times [2024-10-12 20:26:39,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:39,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006550196] [2024-10-12 20:26:39,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:39,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 20:26:39,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:39,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006550196] [2024-10-12 20:26:39,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006550196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:39,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:39,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:26:39,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169083814] [2024-10-12 20:26:39,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:39,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:26:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:39,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:26:39,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:26:39,558 INFO L87 Difference]: Start difference. First operand 7679 states and 9876 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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:26:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:39,611 INFO L93 Difference]: Finished difference Result 14657 states and 18939 transitions. [2024-10-12 20:26:39,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:26:39,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 101 [2024-10-12 20:26:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:39,621 INFO L225 Difference]: With dead ends: 14657 [2024-10-12 20:26:39,622 INFO L226 Difference]: Without dead ends: 7043 [2024-10-12 20:26:39,630 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:26:39,634 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 82 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:39,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 100 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7043 states. [2024-10-12 20:26:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7043 to 7043. [2024-10-12 20:26:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7043 states, 7042 states have (on average 1.2808861119000283) internal successors, (9020), 7042 states have internal predecessors, (9020), 0 states have call successors, (0), 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:26:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7043 states to 7043 states and 9020 transitions. [2024-10-12 20:26:39,714 INFO L78 Accepts]: Start accepts. Automaton has 7043 states and 9020 transitions. Word has length 101 [2024-10-12 20:26:39,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:39,715 INFO L471 AbstractCegarLoop]: Abstraction has 7043 states and 9020 transitions. [2024-10-12 20:26:39,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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:26:39,715 INFO L276 IsEmpty]: Start isEmpty. Operand 7043 states and 9020 transitions. [2024-10-12 20:26:39,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:26:39,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:39,717 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:39,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 20:26:39,717 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:39,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:39,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1795834775, now seen corresponding path program 1 times [2024-10-12 20:26:39,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:39,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151009677] [2024-10-12 20:26:39,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:39,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:40,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:40,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151009677] [2024-10-12 20:26:40,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151009677] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:26:40,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170342073] [2024-10-12 20:26:40,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:40,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:40,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:26:40,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:26:40,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 20:26:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:40,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 20:26:40,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:26:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 20:26:40,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:26:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170342073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:40,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:26:40,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2024-10-12 20:26:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938373564] [2024-10-12 20:26:40,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:40,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:26:40,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:40,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:26:40,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:26:40,507 INFO L87 Difference]: Start difference. First operand 7043 states and 9020 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:26:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:40,798 INFO L93 Difference]: Finished difference Result 21025 states and 26950 transitions. [2024-10-12 20:26:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:26:40,802 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 101 [2024-10-12 20:26:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:40,820 INFO L225 Difference]: With dead ends: 21025 [2024-10-12 20:26:40,820 INFO L226 Difference]: Without dead ends: 14041 [2024-10-12 20:26:40,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-10-12 20:26:40,829 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 248 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:40,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 457 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:26:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14041 states. [2024-10-12 20:26:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14041 to 7043. [2024-10-12 20:26:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7043 states, 7042 states have (on average 1.2807441067878444) internal successors, (9019), 7042 states have internal predecessors, (9019), 0 states have call successors, (0), 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:26:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7043 states to 7043 states and 9019 transitions. [2024-10-12 20:26:40,975 INFO L78 Accepts]: Start accepts. Automaton has 7043 states and 9019 transitions. Word has length 101 [2024-10-12 20:26:40,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:40,975 INFO L471 AbstractCegarLoop]: Abstraction has 7043 states and 9019 transitions. [2024-10-12 20:26:40,976 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:26:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 7043 states and 9019 transitions. [2024-10-12 20:26:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 20:26:40,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:40,978 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:40,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 20:26:41,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:41,179 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:41,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:41,180 INFO L85 PathProgramCache]: Analyzing trace with hash 446079846, now seen corresponding path program 1 times [2024-10-12 20:26:41,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:41,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082059472] [2024-10-12 20:26:41,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:41,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:41,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:41,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082059472] [2024-10-12 20:26:41,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082059472] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:26:41,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512699812] [2024-10-12 20:26:41,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:41,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:41,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:26:41,569 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:26:41,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 20:26:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:41,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-12 20:26:41,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:26:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 20:26:41,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:26:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 20:26:42,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512699812] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:26:42,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:26:42,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 8] total 23 [2024-10-12 20:26:42,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731655735] [2024-10-12 20:26:42,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:26:42,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-12 20:26:42,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:42,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 20:26:42,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:26:42,609 INFO L87 Difference]: Start difference. First operand 7043 states and 9019 transitions. Second operand has 23 states, 23 states have (on average 12.652173913043478) internal successors, (291), 23 states have internal predecessors, (291), 0 states have call successors, (0), 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:26:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:51,849 INFO L93 Difference]: Finished difference Result 46993 states and 60903 transitions. [2024-10-12 20:26:51,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2024-10-12 20:26:51,850 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 12.652173913043478) internal successors, (291), 23 states have internal predecessors, (291), 0 states have call successors, (0), 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 102 [2024-10-12 20:26:51,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:51,898 INFO L225 Difference]: With dead ends: 46993 [2024-10-12 20:26:51,898 INFO L226 Difference]: Without dead ends: 39951 [2024-10-12 20:26:51,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27029 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=6373, Invalid=58397, Unknown=0, NotChecked=0, Total=64770 [2024-10-12 20:26:51,919 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 2955 mSDsluCounter, 4124 mSDsCounter, 0 mSdLazyCounter, 9289 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2955 SdHoareTripleChecker+Valid, 4489 SdHoareTripleChecker+Invalid, 9371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 9289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:51,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2955 Valid, 4489 Invalid, 9371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 9289 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-12 20:26:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39951 states. [2024-10-12 20:26:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39951 to 28857. [2024-10-12 20:26:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28857 states, 28856 states have (on average 1.28524397005822) internal successors, (37087), 28856 states have internal predecessors, (37087), 0 states have call successors, (0), 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:26:52,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28857 states to 28857 states and 37087 transitions. [2024-10-12 20:26:52,302 INFO L78 Accepts]: Start accepts. Automaton has 28857 states and 37087 transitions. Word has length 102 [2024-10-12 20:26:52,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:52,302 INFO L471 AbstractCegarLoop]: Abstraction has 28857 states and 37087 transitions. [2024-10-12 20:26:52,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.652173913043478) internal successors, (291), 23 states have internal predecessors, (291), 0 states have call successors, (0), 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:26:52,303 INFO L276 IsEmpty]: Start isEmpty. Operand 28857 states and 37087 transitions. [2024-10-12 20:26:52,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 20:26:52,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:52,305 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:52,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 20:26:52,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:52,507 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:52,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:52,507 INFO L85 PathProgramCache]: Analyzing trace with hash -621356928, now seen corresponding path program 1 times [2024-10-12 20:26:52,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:52,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049524892] [2024-10-12 20:26:52,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:52,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:52,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:52,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049524892] [2024-10-12 20:26:52,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049524892] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:26:52,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896930857] [2024-10-12 20:26:52,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:52,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:52,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:26:52,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:26:52,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 20:26:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:53,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-12 20:26:53,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:26:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:54,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:26:57,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:57,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896930857] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:26:57,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:26:57,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 40 [2024-10-12 20:26:57,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476568099] [2024-10-12 20:26:57,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:26:57,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-12 20:26:57,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:57,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-12 20:26:57,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1444, Unknown=0, NotChecked=0, Total=1560 [2024-10-12 20:26:57,212 INFO L87 Difference]: Start difference. First operand 28857 states and 37087 transitions. Second operand has 40 states, 40 states have (on average 7.225) internal successors, (289), 40 states have internal predecessors, (289), 0 states have call successors, (0), 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:27:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:36,775 INFO L93 Difference]: Finished difference Result 286951 states and 371701 transitions. [2024-10-12 20:27:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 377 states. [2024-10-12 20:27:36,775 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.225) internal successors, (289), 40 states have internal predecessors, (289), 0 states have call successors, (0), 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 103 [2024-10-12 20:27:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:37,284 INFO L225 Difference]: With dead ends: 286951 [2024-10-12 20:27:37,285 INFO L226 Difference]: Without dead ends: 258197 [2024-10-12 20:27:37,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 413 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71477 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=13547, Invalid=158263, Unknown=0, NotChecked=0, Total=171810 [2024-10-12 20:27:37,341 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 10238 mSDsluCounter, 3360 mSDsCounter, 0 mSdLazyCounter, 4911 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10238 SdHoareTripleChecker+Valid, 3511 SdHoareTripleChecker+Invalid, 5088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 4911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:37,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10238 Valid, 3511 Invalid, 5088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 4911 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-12 20:27:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258197 states. [2024-10-12 20:27:39,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258197 to 137069. [2024-10-12 20:27:39,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137069 states, 137068 states have (on average 1.296042840050194) internal successors, (177646), 137068 states have internal predecessors, (177646), 0 states have call successors, (0), 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:27:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137069 states to 137069 states and 177646 transitions. [2024-10-12 20:27:39,983 INFO L78 Accepts]: Start accepts. Automaton has 137069 states and 177646 transitions. Word has length 103 [2024-10-12 20:27:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:39,983 INFO L471 AbstractCegarLoop]: Abstraction has 137069 states and 177646 transitions. [2024-10-12 20:27:39,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.225) internal successors, (289), 40 states have internal predecessors, (289), 0 states have call successors, (0), 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:27:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand 137069 states and 177646 transitions. [2024-10-12 20:27:39,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 20:27:39,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:39,995 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:40,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 20:27:40,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:27:40,195 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:27:40,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1411152920, now seen corresponding path program 1 times [2024-10-12 20:27:40,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:40,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553108430] [2024-10-12 20:27:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:40,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:40,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:40,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553108430] [2024-10-12 20:27:40,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553108430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:27:40,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325602872] [2024-10-12 20:27:40,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:40,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:27:40,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:27:40,409 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:27:40,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process