./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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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.1.ufo.BOUNDED-6.pals.c.v+sep-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 46dda72cbacea7804179bc67e21a7607713ae67e303b365119c911cce7c0e646 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:50:56,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:50:56,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:50:56,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:50:56,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:50:56,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:50:56,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:50:56,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:50:56,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:50:56,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:50:56,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:50:56,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:50:56,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:50:56,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:50:56,968 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:50:56,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:50:56,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:50:56,969 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:50:56,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:50:56,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:50:56,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:50:56,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:50:56,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:50:56,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:50:56,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:50:56,972 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:50:56,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:50:56,976 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:50:56,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:50:56,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:50:56,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:50:56,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:50:56,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:50:56,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:50:56,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:50:56,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:50:56,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:50:56,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:50:56,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:50:56,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:50:56,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:50:56,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:50:56,981 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 -> 46dda72cbacea7804179bc67e21a7607713ae67e303b365119c911cce7c0e646 [2024-11-19 22:50:57,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:50:57,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:50:57,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:50:57,308 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:50:57,309 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:50:57,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-11-19 22:50:58,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:50:59,077 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:50:59,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-11-19 22:50:59,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276efab54/832684d75ace44f1ba57432692e177ee/FLAG3537a268c [2024-11-19 22:50:59,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276efab54/832684d75ace44f1ba57432692e177ee [2024-11-19 22:50:59,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:50:59,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:50:59,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:50:59,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:50:59,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:50:59,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:50:59" (1/1) ... [2024-11-19 22:50:59,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513fa806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:59, skipping insertion in model container [2024-11-19 22:50:59,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:50:59" (1/1) ... [2024-11-19 22:50:59,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:50:59,437 WARN L250 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[6199,6212] [2024-11-19 22:50:59,474 WARN L250 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[9205,9218] [2024-11-19 22:50:59,503 WARN L250 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12265,12278] [2024-11-19 22:50:59,529 WARN L250 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[15172,15185] [2024-11-19 22:50:59,547 WARN L250 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[18387,18400] [2024-11-19 22:50:59,565 WARN L250 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21499,21512] [2024-11-19 22:50:59,582 WARN L250 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24550,24563] [2024-11-19 22:50:59,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:50:59,637 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:50:59,664 WARN L250 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[6199,6212] [2024-11-19 22:50:59,673 WARN L250 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[9205,9218] [2024-11-19 22:50:59,716 WARN L250 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12265,12278] [2024-11-19 22:50:59,772 WARN L250 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[15172,15185] [2024-11-19 22:50:59,789 WARN L250 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[18387,18400] [2024-11-19 22:50:59,804 WARN L250 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21499,21512] [2024-11-19 22:50:59,818 WARN L250 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24550,24563] [2024-11-19 22:50:59,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:50:59,875 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:50:59,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:59 WrapperNode [2024-11-19 22:50:59,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:50:59,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:50:59,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:50:59,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:50:59,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:59" (1/1) ... [2024-11-19 22:50:59,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:59" (1/1) ... [2024-11-19 22:50:59,980 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1435 [2024-11-19 22:50:59,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:50:59,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:50:59,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:50:59,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:50:59,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:59" (1/1) ... [2024-11-19 22:50:59,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:59" (1/1) ... [2024-11-19 22:51:00,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:59" (1/1) ... [2024-11-19 22:51:00,044 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-11-19 22:51:00,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:59" (1/1) ... [2024-11-19 22:51:00,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:59" (1/1) ... [2024-11-19 22:51:00,076 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:59" (1/1) ... [2024-11-19 22:51:00,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:59" (1/1) ... [2024-11-19 22:51:00,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:59" (1/1) ... [2024-11-19 22:51:00,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:59" (1/1) ... [2024-11-19 22:51:00,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:51:00,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:51:00,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:51:00,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:51:00,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:59" (1/1) ... [2024-11-19 22:51:00,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:51:00,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:51:00,165 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-11-19 22:51:00,168 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-11-19 22:51:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:51:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:51:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:51:00,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:51:00,398 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:51:00,399 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:51:01,541 INFO L? ?]: Removed 266 outVars from TransFormulas that were not future-live. [2024-11-19 22:51:01,542 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:51:01,570 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:51:01,570 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 22:51:01,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:51:01 BoogieIcfgContainer [2024-11-19 22:51:01,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:51:01,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:51:01,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:51:01,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:51:01,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:50:59" (1/3) ... [2024-11-19 22:51:01,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ce69de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:51:01, skipping insertion in model container [2024-11-19 22:51:01,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:59" (2/3) ... [2024-11-19 22:51:01,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ce69de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:51:01, skipping insertion in model container [2024-11-19 22:51:01,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:51:01" (3/3) ... [2024-11-19 22:51:01,579 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-11-19 22:51:01,598 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:51:01,599 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-19 22:51:01,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:51:01,691 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;@72cc9729, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:51:01,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-19 22:51:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 271 states have (on average 1.7933579335793357) internal successors, (486), 278 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 22:51:01,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:01,717 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-11-19 22:51:01,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:01,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:01,725 INFO L85 PathProgramCache]: Analyzing trace with hash -506083603, now seen corresponding path program 1 times [2024-11-19 22:51:01,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:01,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989508489] [2024-11-19 22:51:01,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:01,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:02,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:02,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989508489] [2024-11-19 22:51:02,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989508489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:02,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:02,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:51:02,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612605753] [2024-11-19 22:51:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:02,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:51:02,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:02,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:51:02,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:51:02,387 INFO L87 Difference]: Start difference. First operand has 279 states, 271 states have (on average 1.7933579335793357) internal successors, (486), 278 states have internal predecessors, (486), 0 states have call successors, (0), 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.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-11-19 22:51:02,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:02,745 INFO L93 Difference]: Finished difference Result 392 states and 660 transitions. [2024-11-19 22:51:02,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:51:02,751 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-11-19 22:51:02,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:02,766 INFO L225 Difference]: With dead ends: 392 [2024-11-19 22:51:02,766 INFO L226 Difference]: Without dead ends: 244 [2024-11-19 22:51:02,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:51:02,776 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1152 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:02,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 300 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:51:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-19 22:51:02,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-11-19 22:51:02,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 243 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 300 transitions. [2024-11-19 22:51:02,839 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 300 transitions. Word has length 48 [2024-11-19 22:51:02,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:02,840 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 300 transitions. [2024-11-19 22:51:02,841 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-11-19 22:51:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 300 transitions. [2024-11-19 22:51:02,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 22:51:02,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:02,844 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-11-19 22:51:02,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:51:02,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:02,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:02,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1206513712, now seen corresponding path program 1 times [2024-11-19 22:51:02,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:02,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11057828] [2024-11-19 22:51:02,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:03,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:03,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11057828] [2024-11-19 22:51:03,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11057828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:03,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:03,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:51:03,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983338514] [2024-11-19 22:51:03,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:03,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:51:03,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:03,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:51:03,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:51:03,067 INFO L87 Difference]: Start difference. First operand 244 states and 300 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-11-19 22:51:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:03,239 INFO L93 Difference]: Finished difference Result 312 states and 387 transitions. [2024-11-19 22:51:03,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:51:03,240 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-11-19 22:51:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:03,242 INFO L225 Difference]: With dead ends: 312 [2024-11-19 22:51:03,242 INFO L226 Difference]: Without dead ends: 186 [2024-11-19 22:51:03,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:51:03,246 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 638 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:03,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 144 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:51:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-19 22:51:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-19 22:51:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 179 states have (on average 1.2681564245810055) internal successors, (227), 185 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 227 transitions. [2024-11-19 22:51:03,262 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 227 transitions. Word has length 48 [2024-11-19 22:51:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:03,262 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 227 transitions. [2024-11-19 22:51:03,263 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-11-19 22:51:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2024-11-19 22:51:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 22:51:03,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:03,264 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-11-19 22:51:03,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:51:03,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:03,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:03,265 INFO L85 PathProgramCache]: Analyzing trace with hash 731649800, now seen corresponding path program 1 times [2024-11-19 22:51:03,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:03,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393481257] [2024-11-19 22:51:03,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:03,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:03,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:03,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393481257] [2024-11-19 22:51:03,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393481257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:03,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:03,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:51:03,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107644384] [2024-11-19 22:51:03,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:03,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:51:03,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:03,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:51:03,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:51:03,445 INFO L87 Difference]: Start difference. First operand 186 states and 227 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-11-19 22:51:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:03,628 INFO L93 Difference]: Finished difference Result 354 states and 447 transitions. [2024-11-19 22:51:03,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:51:03,629 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-11-19 22:51:03,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:03,631 INFO L225 Difference]: With dead ends: 354 [2024-11-19 22:51:03,633 INFO L226 Difference]: Without dead ends: 251 [2024-11-19 22:51:03,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:51:03,635 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 794 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:03,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 199 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:51:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-19 22:51:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 226. [2024-11-19 22:51:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 225 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 290 transitions. [2024-11-19 22:51:03,663 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 290 transitions. Word has length 48 [2024-11-19 22:51:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:03,664 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 290 transitions. [2024-11-19 22:51:03,664 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-11-19 22:51:03,664 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 290 transitions. [2024-11-19 22:51:03,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 22:51:03,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:03,665 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] [2024-11-19 22:51:03,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:51:03,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:03,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:03,666 INFO L85 PathProgramCache]: Analyzing trace with hash 613838546, now seen corresponding path program 1 times [2024-11-19 22:51:03,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:03,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259071891] [2024-11-19 22:51:03,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:03,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:04,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:04,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259071891] [2024-11-19 22:51:04,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259071891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:04,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:04,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:51:04,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247908803] [2024-11-19 22:51:04,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:04,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:51:04,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:04,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:51:04,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:51:04,021 INFO L87 Difference]: Start difference. First operand 226 states and 290 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:04,307 INFO L93 Difference]: Finished difference Result 479 states and 630 transitions. [2024-11-19 22:51:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:51:04,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-19 22:51:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:04,310 INFO L225 Difference]: With dead ends: 479 [2024-11-19 22:51:04,310 INFO L226 Difference]: Without dead ends: 351 [2024-11-19 22:51:04,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:51:04,312 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 461 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:04,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 403 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:51:04,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-19 22:51:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 226. [2024-11-19 22:51:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 225 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-11-19 22:51:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 289 transitions. [2024-11-19 22:51:04,330 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 289 transitions. Word has length 50 [2024-11-19 22:51:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:04,330 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 289 transitions. [2024-11-19 22:51:04,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 289 transitions. [2024-11-19 22:51:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 22:51:04,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:04,331 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] [2024-11-19 22:51:04,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:51:04,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:04,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1717096174, now seen corresponding path program 1 times [2024-11-19 22:51:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:04,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155106337] [2024-11-19 22:51:04,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:04,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:04,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:04,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155106337] [2024-11-19 22:51:04,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155106337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:04,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:04,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:51:04,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51099465] [2024-11-19 22:51:04,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:04,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:51:04,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:04,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:51:04,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:51:04,632 INFO L87 Difference]: Start difference. First operand 226 states and 289 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:05,000 INFO L93 Difference]: Finished difference Result 376 states and 487 transitions. [2024-11-19 22:51:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:51:05,001 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-19 22:51:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:05,002 INFO L225 Difference]: With dead ends: 376 [2024-11-19 22:51:05,003 INFO L226 Difference]: Without dead ends: 370 [2024-11-19 22:51:05,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:51:05,004 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 809 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:05,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 504 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:51:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-19 22:51:05,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 226. [2024-11-19 22:51:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 219 states have (on average 1.3150684931506849) internal successors, (288), 225 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 288 transitions. [2024-11-19 22:51:05,011 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 288 transitions. Word has length 50 [2024-11-19 22:51:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:05,011 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 288 transitions. [2024-11-19 22:51:05,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:05,011 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 288 transitions. [2024-11-19 22:51:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 22:51:05,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:05,012 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] [2024-11-19 22:51:05,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:51:05,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:05,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:05,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1648014290, now seen corresponding path program 1 times [2024-11-19 22:51:05,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:05,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385891175] [2024-11-19 22:51:05,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:05,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:05,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:05,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385891175] [2024-11-19 22:51:05,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385891175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:05,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:05,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:51:05,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766526431] [2024-11-19 22:51:05,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:05,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:51:05,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:05,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:51:05,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:51:05,349 INFO L87 Difference]: Start difference. First operand 226 states and 288 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:05,774 INFO L93 Difference]: Finished difference Result 376 states and 502 transitions. [2024-11-19 22:51:05,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:51:05,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-19 22:51:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:05,776 INFO L225 Difference]: With dead ends: 376 [2024-11-19 22:51:05,776 INFO L226 Difference]: Without dead ends: 273 [2024-11-19 22:51:05,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:51:05,778 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 696 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:05,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 656 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:51:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-19 22:51:05,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 226. [2024-11-19 22:51:05,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 219 states have (on average 1.3105022831050228) internal successors, (287), 225 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 287 transitions. [2024-11-19 22:51:05,784 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 287 transitions. Word has length 50 [2024-11-19 22:51:05,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:05,784 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 287 transitions. [2024-11-19 22:51:05,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 287 transitions. [2024-11-19 22:51:05,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 22:51:05,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:05,785 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-11-19 22:51:05,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:51:05,786 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:05,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:05,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1708755507, now seen corresponding path program 1 times [2024-11-19 22:51:05,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:05,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031409404] [2024-11-19 22:51:05,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:05,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:06,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:06,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031409404] [2024-11-19 22:51:06,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031409404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:06,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:06,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:51:06,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281726980] [2024-11-19 22:51:06,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:06,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:51:06,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:06,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:51:06,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:51:06,389 INFO L87 Difference]: Start difference. First operand 226 states and 287 transitions. Second operand has 12 states, 12 states have (on average 4.25) 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-11-19 22:51:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:06,890 INFO L93 Difference]: Finished difference Result 353 states and 476 transitions. [2024-11-19 22:51:06,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:51:06,891 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) 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-11-19 22:51:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:06,892 INFO L225 Difference]: With dead ends: 353 [2024-11-19 22:51:06,892 INFO L226 Difference]: Without dead ends: 257 [2024-11-19 22:51:06,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-19 22:51:06,893 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 720 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:06,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 866 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:51:06,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-19 22:51:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 214. [2024-11-19 22:51:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 208 states have (on average 1.3125) internal successors, (273), 213 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 273 transitions. [2024-11-19 22:51:06,902 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 273 transitions. Word has length 51 [2024-11-19 22:51:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:06,904 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 273 transitions. [2024-11-19 22:51:06,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) 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-11-19 22:51:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 273 transitions. [2024-11-19 22:51:06,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 22:51:06,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:06,906 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-11-19 22:51:06,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:51:06,908 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:06,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:06,908 INFO L85 PathProgramCache]: Analyzing trace with hash 871420535, now seen corresponding path program 1 times [2024-11-19 22:51:06,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:06,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357385908] [2024-11-19 22:51:06,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:06,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:07,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:07,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357385908] [2024-11-19 22:51:07,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357385908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:07,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:07,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:51:07,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971551642] [2024-11-19 22:51:07,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:07,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:51:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:07,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:51:07,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:51:07,437 INFO L87 Difference]: Start difference. First operand 214 states and 273 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 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-11-19 22:51:07,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:07,994 INFO L93 Difference]: Finished difference Result 354 states and 462 transitions. [2024-11-19 22:51:07,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:51:07,995 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 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-11-19 22:51:07,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:07,998 INFO L225 Difference]: With dead ends: 354 [2024-11-19 22:51:07,999 INFO L226 Difference]: Without dead ends: 350 [2024-11-19 22:51:08,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-19 22:51:08,002 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 724 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:08,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1237 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:51:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-19 22:51:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 210. [2024-11-19 22:51:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.3121951219512196) internal successors, (269), 209 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 269 transitions. [2024-11-19 22:51:08,011 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 269 transitions. Word has length 52 [2024-11-19 22:51:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:08,012 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 269 transitions. [2024-11-19 22:51:08,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 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-11-19 22:51:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 269 transitions. [2024-11-19 22:51:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 22:51:08,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:08,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, 1, 1, 1, 1, 1] [2024-11-19 22:51:08,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:51:08,014 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:08,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1375412663, now seen corresponding path program 1 times [2024-11-19 22:51:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:08,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533012631] [2024-11-19 22:51:08,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:08,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:08,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:08,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533012631] [2024-11-19 22:51:08,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533012631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:08,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:08,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:51:08,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761823038] [2024-11-19 22:51:08,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:08,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:51:08,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:08,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:51:08,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:51:08,498 INFO L87 Difference]: Start difference. First operand 210 states and 269 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 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-11-19 22:51:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:08,998 INFO L93 Difference]: Finished difference Result 430 states and 580 transitions. [2024-11-19 22:51:08,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:51:08,998 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 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-11-19 22:51:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:09,000 INFO L225 Difference]: With dead ends: 430 [2024-11-19 22:51:09,000 INFO L226 Difference]: Without dead ends: 342 [2024-11-19 22:51:09,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:51:09,001 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 998 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:09,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 708 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:51:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-19 22:51:09,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 206. [2024-11-19 22:51:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 202 states have (on average 1.306930693069307) internal successors, (264), 205 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 264 transitions. [2024-11-19 22:51:09,009 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 264 transitions. Word has length 52 [2024-11-19 22:51:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:09,009 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 264 transitions. [2024-11-19 22:51:09,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 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-11-19 22:51:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 264 transitions. [2024-11-19 22:51:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 22:51:09,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:09,010 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-11-19 22:51:09,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:51:09,011 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-11-19 22:51:09,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash -895336457, now seen corresponding path program 1 times [2024-11-19 22:51:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:09,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791424832] [2024-11-19 22:51:09,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:09,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:09,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791424832] [2024-11-19 22:51:09,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791424832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:09,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:09,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:51:09,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660069280] [2024-11-19 22:51:09,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:09,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:51:09,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:09,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:51:09,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:51:09,274 INFO L87 Difference]: Start difference. First operand 206 states and 264 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 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-11-19 22:51:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:09,623 INFO L93 Difference]: Finished difference Result 354 states and 459 transitions. [2024-11-19 22:51:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:51:09,623 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 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-11-19 22:51:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:09,625 INFO L225 Difference]: With dead ends: 354 [2024-11-19 22:51:09,625 INFO L226 Difference]: Without dead ends: 346 [2024-11-19 22:51:09,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:51:09,626 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 962 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:09,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 479 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:51:09,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-19 22:51:09,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 206. [2024-11-19 22:51:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 202 states have (on average 1.301980198019802) internal successors, (263), 205 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:09,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 263 transitions. [2024-11-19 22:51:09,635 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 263 transitions. Word has length 54 [2024-11-19 22:51:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:09,636 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 263 transitions. [2024-11-19 22:51:09,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 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-11-19 22:51:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 263 transitions. [2024-11-19 22:51:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 22:51:09,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:09,637 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-11-19 22:51:09,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 22:51:09,637 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:09,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:09,638 INFO L85 PathProgramCache]: Analyzing trace with hash 4832631, now seen corresponding path program 1 times [2024-11-19 22:51:09,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:09,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67642135] [2024-11-19 22:51:09,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:09,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:09,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:09,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67642135] [2024-11-19 22:51:09,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67642135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:09,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:09,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:51:09,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701404047] [2024-11-19 22:51:09,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:09,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:51:09,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:09,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:51:09,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:51:09,864 INFO L87 Difference]: Start difference. First operand 206 states and 263 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 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-11-19 22:51:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:10,143 INFO L93 Difference]: Finished difference Result 327 states and 431 transitions. [2024-11-19 22:51:10,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:51:10,143 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 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-11-19 22:51:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:10,144 INFO L225 Difference]: With dead ends: 327 [2024-11-19 22:51:10,144 INFO L226 Difference]: Without dead ends: 209 [2024-11-19 22:51:10,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:51:10,145 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 247 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:10,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 440 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:51:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-19 22:51:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-11-19 22:51:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 202 states have (on average 1.2920792079207921) internal successors, (261), 205 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 261 transitions. [2024-11-19 22:51:10,151 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 261 transitions. Word has length 54 [2024-11-19 22:51:10,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:10,151 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 261 transitions. [2024-11-19 22:51:10,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 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-11-19 22:51:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 261 transitions. [2024-11-19 22:51:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 22:51:10,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:10,152 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-11-19 22:51:10,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 22:51:10,153 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:10,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash -924533993, now seen corresponding path program 1 times [2024-11-19 22:51:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:10,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279401936] [2024-11-19 22:51:10,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:10,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:10,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:10,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279401936] [2024-11-19 22:51:10,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279401936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:10,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:10,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:51:10,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357981381] [2024-11-19 22:51:10,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:10,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:51:10,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:10,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:51:10,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:51:10,542 INFO L87 Difference]: Start difference. First operand 206 states and 261 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 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-11-19 22:51:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:11,310 INFO L93 Difference]: Finished difference Result 590 states and 800 transitions. [2024-11-19 22:51:11,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:51:11,310 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 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-11-19 22:51:11,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:11,313 INFO L225 Difference]: With dead ends: 590 [2024-11-19 22:51:11,313 INFO L226 Difference]: Without dead ends: 582 [2024-11-19 22:51:11,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:51:11,314 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1578 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:11,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 841 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:51:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-19 22:51:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 211. [2024-11-19 22:51:11,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 207 states have (on average 1.285024154589372) internal successors, (266), 210 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 266 transitions. [2024-11-19 22:51:11,321 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 266 transitions. Word has length 54 [2024-11-19 22:51:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:11,321 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 266 transitions. [2024-11-19 22:51:11,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 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-11-19 22:51:11,321 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 266 transitions. [2024-11-19 22:51:11,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 22:51:11,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:11,322 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-11-19 22:51:11,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 22:51:11,322 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:11,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:11,323 INFO L85 PathProgramCache]: Analyzing trace with hash 232129054, now seen corresponding path program 1 times [2024-11-19 22:51:11,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:11,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386905623] [2024-11-19 22:51:11,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:11,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:11,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:11,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386905623] [2024-11-19 22:51:11,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386905623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:11,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:11,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:51:11,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38517500] [2024-11-19 22:51:11,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:11,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:51:11,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:11,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:51:11,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:51:11,530 INFO L87 Difference]: Start difference. First operand 211 states and 266 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 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-11-19 22:51:11,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:11,922 INFO L93 Difference]: Finished difference Result 354 states and 455 transitions. [2024-11-19 22:51:11,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:51:11,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 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-11-19 22:51:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:11,924 INFO L225 Difference]: With dead ends: 354 [2024-11-19 22:51:11,924 INFO L226 Difference]: Without dead ends: 346 [2024-11-19 22:51:11,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:51:11,925 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 527 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:11,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 673 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:51:11,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-19 22:51:11,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 206. [2024-11-19 22:51:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 202 states have (on average 1.2871287128712872) internal successors, (260), 205 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 260 transitions. [2024-11-19 22:51:11,930 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 260 transitions. Word has length 55 [2024-11-19 22:51:11,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:11,931 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 260 transitions. [2024-11-19 22:51:11,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 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-11-19 22:51:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 260 transitions. [2024-11-19 22:51:11,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 22:51:11,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:11,932 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] [2024-11-19 22:51:11,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 22:51:11,932 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:11,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1614885916, now seen corresponding path program 1 times [2024-11-19 22:51:11,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:11,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415736916] [2024-11-19 22:51:11,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:11,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:12,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415736916] [2024-11-19 22:51:12,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415736916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:12,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:12,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:51:12,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662983491] [2024-11-19 22:51:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:12,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:51:12,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:12,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:51:12,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:51:12,418 INFO L87 Difference]: Start difference. First operand 206 states and 260 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:12,933 INFO L93 Difference]: Finished difference Result 336 states and 438 transitions. [2024-11-19 22:51:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:51:12,934 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-19 22:51:12,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:12,936 INFO L225 Difference]: With dead ends: 336 [2024-11-19 22:51:12,936 INFO L226 Difference]: Without dead ends: 330 [2024-11-19 22:51:12,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:51:12,937 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 634 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:12,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 1006 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:51:12,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-19 22:51:12,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 200. [2024-11-19 22:51:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 197 states have (on average 1.284263959390863) internal successors, (253), 199 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 253 transitions. [2024-11-19 22:51:12,943 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 253 transitions. Word has length 56 [2024-11-19 22:51:12,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:12,943 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 253 transitions. [2024-11-19 22:51:12,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:12,943 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 253 transitions. [2024-11-19 22:51:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 22:51:12,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:12,944 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] [2024-11-19 22:51:12,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 22:51:12,944 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:12,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:12,945 INFO L85 PathProgramCache]: Analyzing trace with hash 897405148, now seen corresponding path program 1 times [2024-11-19 22:51:12,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:12,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828854138] [2024-11-19 22:51:12,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:13,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:13,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828854138] [2024-11-19 22:51:13,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828854138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:13,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:13,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-19 22:51:13,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280089365] [2024-11-19 22:51:13,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:13,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 22:51:13,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:13,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 22:51:13,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:51:13,690 INFO L87 Difference]: Start difference. First operand 200 states and 253 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:14,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:14,552 INFO L93 Difference]: Finished difference Result 238 states and 290 transitions. [2024-11-19 22:51:14,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 22:51:14,553 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-19 22:51:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:14,553 INFO L225 Difference]: With dead ends: 238 [2024-11-19 22:51:14,553 INFO L226 Difference]: Without dead ends: 229 [2024-11-19 22:51:14,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=911, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 22:51:14,555 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 528 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:14,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1500 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:51:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-19 22:51:14,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 203. [2024-11-19 22:51:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 200 states have (on average 1.28) internal successors, (256), 202 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 256 transitions. [2024-11-19 22:51:14,559 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 256 transitions. Word has length 56 [2024-11-19 22:51:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:14,560 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 256 transitions. [2024-11-19 22:51:14,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 256 transitions. [2024-11-19 22:51:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 22:51:14,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:14,565 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] [2024-11-19 22:51:14,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 22:51:14,566 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:14,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:14,566 INFO L85 PathProgramCache]: Analyzing trace with hash -712982628, now seen corresponding path program 1 times [2024-11-19 22:51:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:14,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644971449] [2024-11-19 22:51:14,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:14,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:14,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:14,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644971449] [2024-11-19 22:51:14,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644971449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:14,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:14,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:51:14,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483548056] [2024-11-19 22:51:14,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:14,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 22:51:14,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:14,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 22:51:14,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:51:14,980 INFO L87 Difference]: Start difference. First operand 203 states and 256 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:15,368 INFO L93 Difference]: Finished difference Result 312 states and 406 transitions. [2024-11-19 22:51:15,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:51:15,369 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-19 22:51:15,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:15,371 INFO L225 Difference]: With dead ends: 312 [2024-11-19 22:51:15,371 INFO L226 Difference]: Without dead ends: 292 [2024-11-19 22:51:15,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:51:15,372 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 550 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:15,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 755 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:51:15,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-19 22:51:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 183. [2024-11-19 22:51:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 181 states have (on average 1.292817679558011) internal successors, (234), 182 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 234 transitions. [2024-11-19 22:51:15,380 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 234 transitions. Word has length 56 [2024-11-19 22:51:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:15,380 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 234 transitions. [2024-11-19 22:51:15,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 234 transitions. [2024-11-19 22:51:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 22:51:15,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:15,381 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] [2024-11-19 22:51:15,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 22:51:15,381 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:15,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:15,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1985133879, now seen corresponding path program 1 times [2024-11-19 22:51:15,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:15,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555053964] [2024-11-19 22:51:15,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:15,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:16,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:16,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555053964] [2024-11-19 22:51:16,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555053964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:16,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:16,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-19 22:51:16,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909064159] [2024-11-19 22:51:16,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:16,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 22:51:16,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:16,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 22:51:16,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-19 22:51:16,293 INFO L87 Difference]: Start difference. First operand 183 states and 234 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:17,185 INFO L93 Difference]: Finished difference Result 193 states and 243 transitions. [2024-11-19 22:51:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 22:51:17,186 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-11-19 22:51:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:17,187 INFO L225 Difference]: With dead ends: 193 [2024-11-19 22:51:17,187 INFO L226 Difference]: Without dead ends: 180 [2024-11-19 22:51:17,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2024-11-19 22:51:17,188 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 338 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:17,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1036 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:51:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-19 22:51:17,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-11-19 22:51:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 179 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 230 transitions. [2024-11-19 22:51:17,192 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 230 transitions. Word has length 57 [2024-11-19 22:51:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:17,192 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 230 transitions. [2024-11-19 22:51:17,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 230 transitions. [2024-11-19 22:51:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 22:51:17,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:17,193 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] [2024-11-19 22:51:17,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 22:51:17,193 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-19 22:51:17,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:17,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1777868099, now seen corresponding path program 1 times [2024-11-19 22:51:17,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:17,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451387381] [2024-11-19 22:51:17,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:17,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:17,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:17,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451387381] [2024-11-19 22:51:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451387381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:17,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 22:51:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086095436] [2024-11-19 22:51:17,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:17,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 22:51:17,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:17,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 22:51:17,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-19 22:51:17,892 INFO L87 Difference]: Start difference. First operand 180 states and 230 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:18,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:18,425 INFO L93 Difference]: Finished difference Result 180 states and 230 transitions. [2024-11-19 22:51:18,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 22:51:18,426 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-11-19 22:51:18,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:18,427 INFO L225 Difference]: With dead ends: 180 [2024-11-19 22:51:18,427 INFO L226 Difference]: Without dead ends: 167 [2024-11-19 22:51:18,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-11-19 22:51:18,428 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 71 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:18,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 988 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:51:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-19 22:51:18,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-19 22:51:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 216 transitions. [2024-11-19 22:51:18,432 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 216 transitions. Word has length 57 [2024-11-19 22:51:18,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:18,433 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 216 transitions. [2024-11-19 22:51:18,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 216 transitions. [2024-11-19 22:51:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 22:51:18,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:18,434 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-11-19 22:51:18,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 22:51:18,434 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-11-19 22:51:18,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1117882514, now seen corresponding path program 1 times [2024-11-19 22:51:18,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:18,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209795153] [2024-11-19 22:51:18,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:18,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:18,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:18,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209795153] [2024-11-19 22:51:18,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209795153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:18,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:18,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:51:18,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428020191] [2024-11-19 22:51:18,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:18,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:51:18,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:18,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:51:18,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:51:18,524 INFO L87 Difference]: Start difference. First operand 167 states and 216 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 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-11-19 22:51:18,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:18,595 INFO L93 Difference]: Finished difference Result 671 states and 972 transitions. [2024-11-19 22:51:18,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:51:18,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 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-11-19 22:51:18,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:18,597 INFO L225 Difference]: With dead ends: 671 [2024-11-19 22:51:18,597 INFO L226 Difference]: Without dead ends: 587 [2024-11-19 22:51:18,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:51:18,599 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 534 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:18,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 463 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:51:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-11-19 22:51:18,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 249. [2024-11-19 22:51:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.3588709677419355) internal successors, (337), 248 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 337 transitions. [2024-11-19 22:51:18,606 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 337 transitions. Word has length 75 [2024-11-19 22:51:18,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:18,606 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 337 transitions. [2024-11-19 22:51:18,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 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-11-19 22:51:18,607 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 337 transitions. [2024-11-19 22:51:18,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 22:51:18,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:18,607 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-11-19 22:51:18,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 22:51:18,608 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-11-19 22:51:18,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:18,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1016465065, now seen corresponding path program 1 times [2024-11-19 22:51:18,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:18,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145084964] [2024-11-19 22:51:18,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:18,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:18,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:18,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145084964] [2024-11-19 22:51:18,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145084964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:18,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:18,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:51:18,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641616375] [2024-11-19 22:51:18,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:18,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:51:18,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:18,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:51:18,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:51:18,708 INFO L87 Difference]: Start difference. First operand 249 states and 337 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-11-19 22:51:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:18,772 INFO L93 Difference]: Finished difference Result 831 states and 1200 transitions. [2024-11-19 22:51:18,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:51:18,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-11-19 22:51:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:18,775 INFO L225 Difference]: With dead ends: 831 [2024-11-19 22:51:18,775 INFO L226 Difference]: Without dead ends: 665 [2024-11-19 22:51:18,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-19 22:51:18,776 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 295 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:18,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 422 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:51:18,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-19 22:51:18,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 413. [2024-11-19 22:51:18,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.4101941747572815) internal successors, (581), 412 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 581 transitions. [2024-11-19 22:51:18,803 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 581 transitions. Word has length 77 [2024-11-19 22:51:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:18,803 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 581 transitions. [2024-11-19 22:51:18,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-11-19 22:51:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 581 transitions. [2024-11-19 22:51:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 22:51:18,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:18,807 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-11-19 22:51:18,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 22:51:18,807 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-11-19 22:51:18,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1101947074, now seen corresponding path program 1 times [2024-11-19 22:51:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:18,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236039495] [2024-11-19 22:51:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:18,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:18,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236039495] [2024-11-19 22:51:18,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236039495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:18,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:18,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:51:18,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147879586] [2024-11-19 22:51:18,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:18,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:51:18,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:18,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:51:18,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:51:18,865 INFO L87 Difference]: Start difference. First operand 413 states and 581 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-11-19 22:51:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:18,891 INFO L93 Difference]: Finished difference Result 1021 states and 1471 transitions. [2024-11-19 22:51:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:51:18,892 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-11-19 22:51:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:18,894 INFO L225 Difference]: With dead ends: 1021 [2024-11-19 22:51:18,895 INFO L226 Difference]: Without dead ends: 691 [2024-11-19 22:51:18,895 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-11-19 22:51:18,896 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 51 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 290 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-11-19 22:51:18,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 290 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:51:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-11-19 22:51:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2024-11-19 22:51:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.3997093023255813) internal successors, (963), 688 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 963 transitions. [2024-11-19 22:51:18,911 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 963 transitions. Word has length 77 [2024-11-19 22:51:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:18,911 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 963 transitions. [2024-11-19 22:51:18,911 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-11-19 22:51:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 963 transitions. [2024-11-19 22:51:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 22:51:18,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:18,913 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-11-19 22:51:18,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 22:51:18,913 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-11-19 22:51:18,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:18,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1035453562, now seen corresponding path program 1 times [2024-11-19 22:51:18,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:18,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474553144] [2024-11-19 22:51:18,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:18,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:18,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474553144] [2024-11-19 22:51:18,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474553144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:18,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:18,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:51:18,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459254830] [2024-11-19 22:51:18,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:18,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:51:18,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:18,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:51:18,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:51:18,969 INFO L87 Difference]: Start difference. First operand 689 states and 963 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-11-19 22:51:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:18,998 INFO L93 Difference]: Finished difference Result 1297 states and 1837 transitions. [2024-11-19 22:51:18,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:51:18,999 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-11-19 22:51:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:19,002 INFO L225 Difference]: With dead ends: 1297 [2024-11-19 22:51:19,002 INFO L226 Difference]: Without dead ends: 691 [2024-11-19 22:51:19,005 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-11-19 22:51:19,006 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:19,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 209 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:51:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-11-19 22:51:19,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2024-11-19 22:51:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.3938953488372092) internal successors, (959), 688 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:19,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 959 transitions. [2024-11-19 22:51:19,020 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 959 transitions. Word has length 77 [2024-11-19 22:51:19,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:19,020 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 959 transitions. [2024-11-19 22:51:19,021 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-11-19 22:51:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 959 transitions. [2024-11-19 22:51:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 22:51:19,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:19,022 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-11-19 22:51:19,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 22:51:19,022 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-11-19 22:51:19,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:19,023 INFO L85 PathProgramCache]: Analyzing trace with hash -401787049, now seen corresponding path program 1 times [2024-11-19 22:51:19,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:19,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775832773] [2024-11-19 22:51:19,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:19,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:19,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:19,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775832773] [2024-11-19 22:51:19,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775832773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:19,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:19,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:51:19,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376566096] [2024-11-19 22:51:19,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:19,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:51:19,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:19,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:51:19,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:51:19,118 INFO L87 Difference]: Start difference. First operand 689 states and 959 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-11-19 22:51:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:19,181 INFO L93 Difference]: Finished difference Result 1755 states and 2487 transitions. [2024-11-19 22:51:19,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:51:19,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-11-19 22:51:19,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:19,186 INFO L225 Difference]: With dead ends: 1755 [2024-11-19 22:51:19,186 INFO L226 Difference]: Without dead ends: 1451 [2024-11-19 22:51:19,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-19 22:51:19,188 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 288 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:19,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 475 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:51:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2024-11-19 22:51:19,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1143. [2024-11-19 22:51:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.4071803852889668) internal successors, (1607), 1142 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1607 transitions. [2024-11-19 22:51:19,217 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1607 transitions. Word has length 77 [2024-11-19 22:51:19,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:19,217 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1607 transitions. [2024-11-19 22:51:19,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-11-19 22:51:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1607 transitions. [2024-11-19 22:51:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 22:51:19,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:19,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, 1, 1, 1, 1, 1, 1, 1, 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-11-19 22:51:19,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 22:51:19,219 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-11-19 22:51:19,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:19,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1826714967, now seen corresponding path program 1 times [2024-11-19 22:51:19,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:19,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095822751] [2024-11-19 22:51:19,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:19,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:19,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:19,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:19,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095822751] [2024-11-19 22:51:19,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095822751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:19,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:19,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:51:19,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351102850] [2024-11-19 22:51:19,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:19,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:51:19,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:19,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:51:19,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:51:19,311 INFO L87 Difference]: Start difference. First operand 1143 states and 1607 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-11-19 22:51:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:19,379 INFO L93 Difference]: Finished difference Result 2057 states and 2919 transitions. [2024-11-19 22:51:19,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:51:19,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-11-19 22:51:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:19,386 INFO L225 Difference]: With dead ends: 2057 [2024-11-19 22:51:19,386 INFO L226 Difference]: Without dead ends: 1753 [2024-11-19 22:51:19,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-19 22:51:19,390 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 288 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:19,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 431 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:51:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2024-11-19 22:51:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1445. [2024-11-19 22:51:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.4120498614958448) internal successors, (2039), 1444 states have internal predecessors, (2039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2039 transitions. [2024-11-19 22:51:19,424 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2039 transitions. Word has length 77 [2024-11-19 22:51:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:19,424 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2039 transitions. [2024-11-19 22:51:19,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-11-19 22:51:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2039 transitions. [2024-11-19 22:51:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 22:51:19,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:19,426 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-11-19 22:51:19,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 22:51:19,426 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-11-19 22:51:19,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:19,426 INFO L85 PathProgramCache]: Analyzing trace with hash 275968985, now seen corresponding path program 1 times [2024-11-19 22:51:19,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:19,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778693565] [2024-11-19 22:51:19,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:19,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:19,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:19,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778693565] [2024-11-19 22:51:19,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778693565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:19,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:19,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:51:19,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662151064] [2024-11-19 22:51:19,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:19,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:51:19,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:19,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:51:19,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:51:19,529 INFO L87 Difference]: Start difference. First operand 1445 states and 2039 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-11-19 22:51:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:19,558 INFO L93 Difference]: Finished difference Result 3683 states and 5215 transitions. [2024-11-19 22:51:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:51:19,558 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-11-19 22:51:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:19,566 INFO L225 Difference]: With dead ends: 3683 [2024-11-19 22:51:19,566 INFO L226 Difference]: Without dead ends: 2321 [2024-11-19 22:51:19,569 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-11-19 22:51:19,570 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 60 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:19,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 269 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:51:19,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2024-11-19 22:51:19,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2175. [2024-11-19 22:51:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2175 states, 2174 states have (on average 1.3942042318307268) internal successors, (3031), 2174 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 2175 states and 3031 transitions. [2024-11-19 22:51:19,619 INFO L78 Accepts]: Start accepts. Automaton has 2175 states and 3031 transitions. Word has length 78 [2024-11-19 22:51:19,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:19,619 INFO L471 AbstractCegarLoop]: Abstraction has 2175 states and 3031 transitions. [2024-11-19 22:51:19,620 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-11-19 22:51:19,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2175 states and 3031 transitions. [2024-11-19 22:51:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 22:51:19,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:19,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:51:19,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 22:51:19,622 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-11-19 22:51:19,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:19,622 INFO L85 PathProgramCache]: Analyzing trace with hash -163971304, now seen corresponding path program 1 times [2024-11-19 22:51:19,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:19,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944967231] [2024-11-19 22:51:19,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:19,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:19,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:19,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944967231] [2024-11-19 22:51:19,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944967231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:19,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:19,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:51:19,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314256581] [2024-11-19 22:51:19,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:19,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:51:19,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:19,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:51:19,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:51:19,679 INFO L87 Difference]: Start difference. First operand 2175 states and 3031 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:19,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:19,713 INFO L93 Difference]: Finished difference Result 4351 states and 6088 transitions. [2024-11-19 22:51:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:51:19,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-19 22:51:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:19,720 INFO L225 Difference]: With dead ends: 4351 [2024-11-19 22:51:19,721 INFO L226 Difference]: Without dead ends: 2259 [2024-11-19 22:51:19,723 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-11-19 22:51:19,724 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 68 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:19,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 204 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:51:19,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2024-11-19 22:51:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 2257. [2024-11-19 22:51:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.377659574468085) internal successors, (3108), 2256 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3108 transitions. [2024-11-19 22:51:19,770 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3108 transitions. Word has length 79 [2024-11-19 22:51:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:19,771 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3108 transitions. [2024-11-19 22:51:19,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3108 transitions. [2024-11-19 22:51:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 22:51:19,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:19,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:51:19,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 22:51:19,774 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-11-19 22:51:19,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:19,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1432796505, now seen corresponding path program 1 times [2024-11-19 22:51:19,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:19,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911156340] [2024-11-19 22:51:19,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:19,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:19,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:19,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911156340] [2024-11-19 22:51:19,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911156340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:19,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:19,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:51:19,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876701682] [2024-11-19 22:51:19,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:19,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:51:19,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:19,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:51:19,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:51:19,857 INFO L87 Difference]: Start difference. First operand 2257 states and 3108 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:19,896 INFO L93 Difference]: Finished difference Result 6381 states and 8752 transitions. [2024-11-19 22:51:19,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:51:19,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-19 22:51:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:19,911 INFO L225 Difference]: With dead ends: 6381 [2024-11-19 22:51:19,912 INFO L226 Difference]: Without dead ends: 4207 [2024-11-19 22:51:19,915 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-11-19 22:51:19,916 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 53 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:19,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 265 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:51:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4207 states. [2024-11-19 22:51:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4207 to 3981. [2024-11-19 22:51:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3980 states have (on average 1.3560301507537689) internal successors, (5397), 3980 states have internal predecessors, (5397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 5397 transitions. [2024-11-19 22:51:20,012 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 5397 transitions. Word has length 79 [2024-11-19 22:51:20,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:20,013 INFO L471 AbstractCegarLoop]: Abstraction has 3981 states and 5397 transitions. [2024-11-19 22:51:20,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 5397 transitions. [2024-11-19 22:51:20,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:51:20,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 22:51:20,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 22:51:20,015 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-11-19 22:51:20,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:20,015 INFO L85 PathProgramCache]: Analyzing trace with hash -21206962, now seen corresponding path program 1 times [2024-11-19 22:51:20,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:20,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690642804] [2024-11-19 22:51:20,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:20,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:20,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:20,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:20,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690642804] [2024-11-19 22:51:20,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690642804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:20,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:20,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:51:20,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328674670] [2024-11-19 22:51:20,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:20,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:51:20,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:20,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:51:20,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:51:20,130 INFO L87 Difference]: Start difference. First operand 3981 states and 5397 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:20,185 INFO L93 Difference]: Finished difference Result 11329 states and 15227 transitions. [2024-11-19 22:51:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:51:20,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:51:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:20,221 INFO L225 Difference]: With dead ends: 11329 [2024-11-19 22:51:20,221 INFO L226 Difference]: Without dead ends: 7431 [2024-11-19 22:51:20,231 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-11-19 22:51:20,232 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 43 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:20,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 265 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:51:20,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2024-11-19 22:51:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 6981. [2024-11-19 22:51:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6981 states, 6980 states have (on average 1.324785100286533) internal successors, (9247), 6980 states have internal predecessors, (9247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6981 states to 6981 states and 9247 transitions. [2024-11-19 22:51:20,373 INFO L78 Accepts]: Start accepts. Automaton has 6981 states and 9247 transitions. Word has length 80 [2024-11-19 22:51:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:20,374 INFO L471 AbstractCegarLoop]: Abstraction has 6981 states and 9247 transitions. [2024-11-19 22:51:20,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 6981 states and 9247 transitions. [2024-11-19 22:51:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:51:20,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:20,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:51:20,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 22:51:20,375 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-11-19 22:51:20,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1223980109, now seen corresponding path program 1 times [2024-11-19 22:51:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:20,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924873308] [2024-11-19 22:51:20,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:20,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:20,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924873308] [2024-11-19 22:51:20,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924873308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:20,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:20,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:51:20,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065154740] [2024-11-19 22:51:20,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:20,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:51:20,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:20,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:51:20,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:51:20,582 INFO L87 Difference]: Start difference. First operand 6981 states and 9247 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:20,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:20,660 INFO L93 Difference]: Finished difference Result 7175 states and 9504 transitions. [2024-11-19 22:51:20,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:51:20,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-19 22:51:20,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:20,681 INFO L225 Difference]: With dead ends: 7175 [2024-11-19 22:51:20,681 INFO L226 Difference]: Without dead ends: 7173 [2024-11-19 22:51:20,685 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-11-19 22:51:20,686 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:20,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 608 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:51:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7173 states. [2024-11-19 22:51:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7173 to 7173. [2024-11-19 22:51:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7173 states, 7172 states have (on average 1.3049358616843278) internal successors, (9359), 7172 states have internal predecessors, (9359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7173 states to 7173 states and 9359 transitions. [2024-11-19 22:51:20,841 INFO L78 Accepts]: Start accepts. Automaton has 7173 states and 9359 transitions. Word has length 81 [2024-11-19 22:51:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:20,841 INFO L471 AbstractCegarLoop]: Abstraction has 7173 states and 9359 transitions. [2024-11-19 22:51:20,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 7173 states and 9359 transitions. [2024-11-19 22:51:20,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 22:51:20,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:20,845 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, 1] [2024-11-19 22:51:20,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 22:51:20,846 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-11-19 22:51:20,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:20,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1680108859, now seen corresponding path program 1 times [2024-11-19 22:51:20,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:20,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166429234] [2024-11-19 22:51:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:21,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:21,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166429234] [2024-11-19 22:51:21,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166429234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:51:21,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143820991] [2024-11-19 22:51:21,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:21,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:51:21,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:51:21,338 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-11-19 22:51:21,340 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-11-19 22:51:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:21,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 22:51:21,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:51:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:22,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:51:23,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-11-19 22:51:23,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143820991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:51:23,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:51:23,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2024-11-19 22:51:23,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553270425] [2024-11-19 22:51:23,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:51:23,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 22:51:23,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:23,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 22:51:23,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:51:23,707 INFO L87 Difference]: Start difference. First operand 7173 states and 9359 transitions. Second operand has 28 states, 28 states have (on average 8.892857142857142) internal successors, (249), 27 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:51:28,341 INFO L93 Difference]: Finished difference Result 67124 states and 87393 transitions. [2024-11-19 22:51:28,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-11-19 22:51:28,342 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.892857142857142) internal successors, (249), 27 states have internal predecessors, (249), 0 states have call successors, (0), 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-11-19 22:51:28,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:51:28,442 INFO L225 Difference]: With dead ends: 67124 [2024-11-19 22:51:28,442 INFO L226 Difference]: Without dead ends: 60034 [2024-11-19 22:51:28,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7096 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3035, Invalid=18135, Unknown=0, NotChecked=0, Total=21170 [2024-11-19 22:51:28,469 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 2898 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2898 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:51:28,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2898 Valid, 2183 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 22:51:28,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60034 states. [2024-11-19 22:51:29,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60034 to 26769. [2024-11-19 22:51:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26769 states, 26768 states have (on average 1.2943066347878063) internal successors, (34646), 26768 states have internal predecessors, (34646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26769 states to 26769 states and 34646 transitions. [2024-11-19 22:51:29,275 INFO L78 Accepts]: Start accepts. Automaton has 26769 states and 34646 transitions. Word has length 103 [2024-11-19 22:51:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:29,275 INFO L471 AbstractCegarLoop]: Abstraction has 26769 states and 34646 transitions. [2024-11-19 22:51:29,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.892857142857142) internal successors, (249), 27 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:51:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 26769 states and 34646 transitions. [2024-11-19 22:51:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 22:51:29,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:29,280 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-11-19 22:51:29,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 22:51:29,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:51:29,481 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-11-19 22:51:29,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:29,482 INFO L85 PathProgramCache]: Analyzing trace with hash -448392738, now seen corresponding path program 1 times [2024-11-19 22:51:29,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:29,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781221724] [2024-11-19 22:51:29,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:29,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:30,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:30,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781221724] [2024-11-19 22:51:30,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781221724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:51:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663705027] [2024-11-19 22:51:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:30,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:51:30,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:51:30,252 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-11-19 22:51:30,254 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-11-19 22:51:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:30,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 22:51:30,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:51:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:31,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:51:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:31,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663705027] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:51:31,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:51:31,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 32 [2024-11-19 22:51:31,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000312013] [2024-11-19 22:51:31,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:51:31,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 22:51:31,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:31,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 22:51:31,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2024-11-19 22:51:31,945 INFO L87 Difference]: Start difference. First operand 26769 states and 34646 transitions. Second operand has 32 states, 32 states have (on average 8.96875) internal successors, (287), 32 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:09,558 INFO L93 Difference]: Finished difference Result 209999 states and 268238 transitions. [2024-11-19 22:52:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 751 states. [2024-11-19 22:52:09,559 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.96875) internal successors, (287), 32 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-19 22:52:09,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:09,949 INFO L225 Difference]: With dead ends: 209999 [2024-11-19 22:52:09,949 INFO L226 Difference]: Without dead ends: 183321 [2024-11-19 22:52:10,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 970 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 779 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293162 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=50624, Invalid=558556, Unknown=0, NotChecked=0, Total=609180 [2024-11-19 22:52:10,078 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 10941 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 3556 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10941 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 3740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 3556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:10,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10941 Valid, 2497 Invalid, 3740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 3556 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 22:52:10,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183321 states. [2024-11-19 22:52:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183321 to 64809. [2024-11-19 22:52:11,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64809 states, 64808 states have (on average 1.284671645475867) internal successors, (83257), 64808 states have internal predecessors, (83257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64809 states to 64809 states and 83257 transitions. [2024-11-19 22:52:12,066 INFO L78 Accepts]: Start accepts. Automaton has 64809 states and 83257 transitions. Word has length 104 [2024-11-19 22:52:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:12,066 INFO L471 AbstractCegarLoop]: Abstraction has 64809 states and 83257 transitions. [2024-11-19 22:52:12,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.96875) internal successors, (287), 32 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 64809 states and 83257 transitions. [2024-11-19 22:52:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 22:52:12,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:12,075 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2024-11-19 22:52:12,085 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-11-19 22:52:12,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-19 22:52:12,276 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-11-19 22:52:12,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:12,277 INFO L85 PathProgramCache]: Analyzing trace with hash -38049661, now seen corresponding path program 1 times [2024-11-19 22:52:12,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:12,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768935044] [2024-11-19 22:52:12,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:12,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:12,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:12,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768935044] [2024-11-19 22:52:12,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768935044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:12,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:12,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:52:12,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173493885] [2024-11-19 22:52:12,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:12,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:52:12,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:12,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:52:12,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:52:12,374 INFO L87 Difference]: Start difference. First operand 64809 states and 83257 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)