./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.09.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/transmitter.09.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 3945fa4b58cef50cb4b44b435a699812e99a1f6375664d08551274c6b50bee45 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:18:04,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:18:04,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:18:04,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:18:04,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:18:04,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:18:05,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:18:05,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:18:05,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:18:05,000 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:18:05,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:18:05,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:18:05,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:18:05,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:18:05,001 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:18:05,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:18:05,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:18:05,002 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:18:05,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:18:05,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:18:05,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:18:05,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:18:05,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:18:05,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:18:05,003 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:18:05,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:18:05,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:18:05,003 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:18:05,003 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:18:05,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:18:05,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:18:05,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:18:05,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:18:05,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:18:05,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:18:05,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:18:05,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:18:05,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:18:05,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:18:05,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:18:05,004 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:18:05,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:18:05,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:18:05,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:18:05,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:18:05,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:18:05,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:18:05,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:18:05,005 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 3945fa4b58cef50cb4b44b435a699812e99a1f6375664d08551274c6b50bee45 [2025-01-09 04:18:05,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:18:05,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:18:05,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:18:05,330 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:18:05,330 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:18:05,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.09.cil.c [2025-01-09 04:18:06,712 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14675cd79/570ba7858d34497d8a913feeb682369f/FLAGea6d1bc7a [2025-01-09 04:18:07,075 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:18:07,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c [2025-01-09 04:18:07,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14675cd79/570ba7858d34497d8a913feeb682369f/FLAGea6d1bc7a [2025-01-09 04:18:07,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14675cd79/570ba7858d34497d8a913feeb682369f [2025-01-09 04:18:07,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:18:07,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:18:07,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:18:07,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:18:07,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:18:07,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:18:07" (1/1) ... [2025-01-09 04:18:07,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a94f75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07, skipping insertion in model container [2025-01-09 04:18:07,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:18:07" (1/1) ... [2025-01-09 04:18:07,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:18:07,484 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c[706,719] [2025-01-09 04:18:07,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:18:07,657 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:18:07,671 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c[706,719] [2025-01-09 04:18:07,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:18:07,775 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:18:07,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07 WrapperNode [2025-01-09 04:18:07,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:18:07,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:18:07,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:18:07,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:18:07,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07" (1/1) ... [2025-01-09 04:18:07,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07" (1/1) ... [2025-01-09 04:18:07,834 INFO L138 Inliner]: procedures = 46, calls = 57, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 643 [2025-01-09 04:18:07,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:18:07,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:18:07,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:18:07,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:18:07,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07" (1/1) ... [2025-01-09 04:18:07,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07" (1/1) ... [2025-01-09 04:18:07,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07" (1/1) ... [2025-01-09 04:18:07,860 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]. [2025-01-09 04:18:07,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07" (1/1) ... [2025-01-09 04:18:07,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07" (1/1) ... [2025-01-09 04:18:07,870 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07" (1/1) ... [2025-01-09 04:18:07,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07" (1/1) ... [2025-01-09 04:18:07,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07" (1/1) ... [2025-01-09 04:18:07,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07" (1/1) ... [2025-01-09 04:18:07,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07" (1/1) ... [2025-01-09 04:18:07,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:18:07,891 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:18:07,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:18:07,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:18:07,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07" (1/1) ... [2025-01-09 04:18:07,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:18:07,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:18:07,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:18:07,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:18:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:18:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 04:18:07,958 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 04:18:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 04:18:07,959 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 04:18:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 04:18:07,959 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 04:18:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 04:18:07,959 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 04:18:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 04:18:07,959 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 04:18:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:18:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 04:18:07,960 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 04:18:07,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:18:07,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:18:08,068 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:18:08,072 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:18:08,920 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-01-09 04:18:08,920 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:18:08,938 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:18:08,939 INFO L312 CfgBuilder]: Removed 13 assume(true) statements. [2025-01-09 04:18:08,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:18:08 BoogieIcfgContainer [2025-01-09 04:18:08,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:18:08,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:18:08,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:18:08,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:18:08,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:18:07" (1/3) ... [2025-01-09 04:18:08,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b7ffc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:18:08, skipping insertion in model container [2025-01-09 04:18:08,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:07" (2/3) ... [2025-01-09 04:18:08,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b7ffc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:18:08, skipping insertion in model container [2025-01-09 04:18:08,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:18:08" (3/3) ... [2025-01-09 04:18:08,948 INFO L128 eAbstractionObserver]: Analyzing ICFG transmitter.09.cil.c [2025-01-09 04:18:08,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:18:08,966 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.09.cil.c that has 7 procedures, 300 locations, 1 initial locations, 13 loop locations, and 1 error locations. [2025-01-09 04:18:09,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:18:09,046 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;@234b5999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:18:09,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:18:09,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 300 states, 271 states have (on average 1.6051660516605166) internal successors, (435), 272 states have internal predecessors, (435), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 04:18:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:18:09,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:09,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:09,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:09,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:09,074 INFO L85 PathProgramCache]: Analyzing trace with hash -896663748, now seen corresponding path program 1 times [2025-01-09 04:18:09,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:09,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705052812] [2025-01-09 04:18:09,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:09,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:09,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:18:09,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:18:09,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:09,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:09,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705052812] [2025-01-09 04:18:09,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705052812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:09,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:09,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:18:09,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919009889] [2025-01-09 04:18:09,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:09,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:18:09,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:09,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:18:09,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:18:09,519 INFO L87 Difference]: Start difference. First operand has 300 states, 271 states have (on average 1.6051660516605166) internal successors, (435), 272 states have internal predecessors, (435), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:09,605 INFO L93 Difference]: Finished difference Result 593 states and 949 transitions. [2025-01-09 04:18:09,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:18:09,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 149 [2025-01-09 04:18:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:09,617 INFO L225 Difference]: With dead ends: 593 [2025-01-09 04:18:09,617 INFO L226 Difference]: Without dead ends: 295 [2025-01-09 04:18:09,624 INFO L434 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 [2025-01-09 04:18:09,628 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 458 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:09,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 462 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:18:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-01-09 04:18:09,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-01-09 04:18:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 266 states have (on average 1.5601503759398496) internal successors, (415), 267 states have internal predecessors, (415), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 04:18:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 459 transitions. [2025-01-09 04:18:09,685 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 459 transitions. Word has length 149 [2025-01-09 04:18:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:09,688 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 459 transitions. [2025-01-09 04:18:09,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:09,689 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 459 transitions. [2025-01-09 04:18:09,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:18:09,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:09,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:09,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:18:09,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:09,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:09,698 INFO L85 PathProgramCache]: Analyzing trace with hash -356234242, now seen corresponding path program 1 times [2025-01-09 04:18:09,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:09,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282580967] [2025-01-09 04:18:09,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:09,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:09,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:18:09,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:18:09,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:09,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:09,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:09,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282580967] [2025-01-09 04:18:09,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282580967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:09,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:09,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:18:09,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850345903] [2025-01-09 04:18:09,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:09,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:18:09,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:09,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:18:09,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:18:09,923 INFO L87 Difference]: Start difference. First operand 295 states and 459 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:09,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:09,973 INFO L93 Difference]: Finished difference Result 576 states and 895 transitions. [2025-01-09 04:18:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:18:09,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 149 [2025-01-09 04:18:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:09,978 INFO L225 Difference]: With dead ends: 576 [2025-01-09 04:18:09,980 INFO L226 Difference]: Without dead ends: 295 [2025-01-09 04:18:09,982 INFO L434 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 [2025-01-09 04:18:09,983 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 445 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:09,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 457 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:18:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-01-09 04:18:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-01-09 04:18:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 266 states have (on average 1.556390977443609) internal successors, (414), 267 states have internal predecessors, (414), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 04:18:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 458 transitions. [2025-01-09 04:18:10,021 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 458 transitions. Word has length 149 [2025-01-09 04:18:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:10,023 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 458 transitions. [2025-01-09 04:18:10,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 458 transitions. [2025-01-09 04:18:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:18:10,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:10,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:10,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:18:10,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:10,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:10,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1261206208, now seen corresponding path program 1 times [2025-01-09 04:18:10,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:10,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95481264] [2025-01-09 04:18:10,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:10,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:10,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:18:10,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:18:10,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:10,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:10,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:10,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95481264] [2025-01-09 04:18:10,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95481264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:10,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:10,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:10,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447670411] [2025-01-09 04:18:10,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:10,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:10,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:10,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:10,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:10,331 INFO L87 Difference]: Start difference. First operand 295 states and 458 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:11,077 INFO L93 Difference]: Finished difference Result 885 states and 1402 transitions. [2025-01-09 04:18:11,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:18:11,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 149 [2025-01-09 04:18:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:11,087 INFO L225 Difference]: With dead ends: 885 [2025-01-09 04:18:11,088 INFO L226 Difference]: Without dead ends: 607 [2025-01-09 04:18:11,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:11,090 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 871 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:11,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1242 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:18:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-01-09 04:18:11,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 584. [2025-01-09 04:18:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 531 states have (on average 1.5687382297551788) internal successors, (833), 533 states have internal predecessors, (833), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-01-09 04:18:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 912 transitions. [2025-01-09 04:18:11,132 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 912 transitions. Word has length 149 [2025-01-09 04:18:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:11,132 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 912 transitions. [2025-01-09 04:18:11,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 912 transitions. [2025-01-09 04:18:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:18:11,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:11,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:11,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:18:11,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:11,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:11,136 INFO L85 PathProgramCache]: Analyzing trace with hash -94052863, now seen corresponding path program 1 times [2025-01-09 04:18:11,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:11,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126681255] [2025-01-09 04:18:11,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:11,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:11,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:18:11,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:18:11,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:11,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:11,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:11,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126681255] [2025-01-09 04:18:11,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126681255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:11,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:11,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:11,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700104582] [2025-01-09 04:18:11,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:11,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:11,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:11,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:11,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:11,405 INFO L87 Difference]: Start difference. First operand 584 states and 912 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:12,466 INFO L93 Difference]: Finished difference Result 1589 states and 2508 transitions. [2025-01-09 04:18:12,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:12,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 149 [2025-01-09 04:18:12,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:12,478 INFO L225 Difference]: With dead ends: 1589 [2025-01-09 04:18:12,478 INFO L226 Difference]: Without dead ends: 1022 [2025-01-09 04:18:12,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:12,483 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 969 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:12,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 2397 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:18:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2025-01-09 04:18:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 853. [2025-01-09 04:18:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 776 states have (on average 1.5618556701030928) internal successors, (1212), 779 states have internal predecessors, (1212), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-01-09 04:18:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1328 transitions. [2025-01-09 04:18:12,561 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1328 transitions. Word has length 149 [2025-01-09 04:18:12,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:12,562 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1328 transitions. [2025-01-09 04:18:12,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1328 transitions. [2025-01-09 04:18:12,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:18:12,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:12,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:12,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:18:12,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:12,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:12,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1042104829, now seen corresponding path program 1 times [2025-01-09 04:18:12,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:12,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733379324] [2025-01-09 04:18:12,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:12,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:12,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:18:12,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:18:12,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:12,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:12,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:12,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733379324] [2025-01-09 04:18:12,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733379324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:12,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:12,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:12,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362053688] [2025-01-09 04:18:12,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:12,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:12,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:12,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:12,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:12,794 INFO L87 Difference]: Start difference. First operand 853 states and 1328 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:13,816 INFO L93 Difference]: Finished difference Result 2445 states and 3853 transitions. [2025-01-09 04:18:13,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:13,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 149 [2025-01-09 04:18:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:13,829 INFO L225 Difference]: With dead ends: 2445 [2025-01-09 04:18:13,830 INFO L226 Difference]: Without dead ends: 1609 [2025-01-09 04:18:13,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:13,836 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 964 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:13,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 2381 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:18:13,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2025-01-09 04:18:13,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1426. [2025-01-09 04:18:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1299 states have (on average 1.565050038491147) internal successors, (2033), 1306 states have internal predecessors, (2033), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-01-09 04:18:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2229 transitions. [2025-01-09 04:18:13,930 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2229 transitions. Word has length 149 [2025-01-09 04:18:13,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:13,932 INFO L471 AbstractCegarLoop]: Abstraction has 1426 states and 2229 transitions. [2025-01-09 04:18:13,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2229 transitions. [2025-01-09 04:18:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:18:13,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:13,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:13,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:18:13,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:13,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:13,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1626876479, now seen corresponding path program 1 times [2025-01-09 04:18:13,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:13,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691683837] [2025-01-09 04:18:13,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:13,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:13,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:18:13,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:18:13,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:13,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:14,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:14,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691683837] [2025-01-09 04:18:14,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691683837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:14,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:14,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:14,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124507642] [2025-01-09 04:18:14,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:14,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:14,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:14,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:14,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:14,143 INFO L87 Difference]: Start difference. First operand 1426 states and 2229 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:15,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:15,151 INFO L93 Difference]: Finished difference Result 4292 states and 6816 transitions. [2025-01-09 04:18:15,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:15,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 149 [2025-01-09 04:18:15,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:15,173 INFO L225 Difference]: With dead ends: 4292 [2025-01-09 04:18:15,173 INFO L226 Difference]: Without dead ends: 2883 [2025-01-09 04:18:15,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:15,181 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 959 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:15,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 2369 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:18:15,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2025-01-09 04:18:15,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2671. [2025-01-09 04:18:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2671 states, 2438 states have (on average 1.5803937653814601) internal successors, (3853), 2459 states have internal predecessors, (3853), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-01-09 04:18:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 4233 transitions. [2025-01-09 04:18:15,373 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 4233 transitions. Word has length 149 [2025-01-09 04:18:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:15,374 INFO L471 AbstractCegarLoop]: Abstraction has 2671 states and 4233 transitions. [2025-01-09 04:18:15,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 4233 transitions. [2025-01-09 04:18:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:18:15,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:15,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:15,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:18:15,381 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:15,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:15,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2061382077, now seen corresponding path program 1 times [2025-01-09 04:18:15,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:15,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093641449] [2025-01-09 04:18:15,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:15,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:15,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:18:15,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:18:15,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:15,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:15,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:15,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093641449] [2025-01-09 04:18:15,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093641449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:15,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:15,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:15,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684042032] [2025-01-09 04:18:15,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:15,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:15,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:15,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:15,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:15,561 INFO L87 Difference]: Start difference. First operand 2671 states and 4233 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:16,673 INFO L93 Difference]: Finished difference Result 8363 states and 13538 transitions. [2025-01-09 04:18:16,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:16,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 149 [2025-01-09 04:18:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:16,711 INFO L225 Difference]: With dead ends: 8363 [2025-01-09 04:18:16,711 INFO L226 Difference]: Without dead ends: 5709 [2025-01-09 04:18:16,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:16,723 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 954 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:16,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 2357 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:18:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5709 states. [2025-01-09 04:18:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5709 to 5440. [2025-01-09 04:18:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5440 states, 4977 states have (on average 1.6059875426964034) internal successors, (7993), 5044 states have internal predecessors, (7993), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-01-09 04:18:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5440 states to 5440 states and 8837 transitions. [2025-01-09 04:18:17,066 INFO L78 Accepts]: Start accepts. Automaton has 5440 states and 8837 transitions. Word has length 149 [2025-01-09 04:18:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:17,067 INFO L471 AbstractCegarLoop]: Abstraction has 5440 states and 8837 transitions. [2025-01-09 04:18:17,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 5440 states and 8837 transitions. [2025-01-09 04:18:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:18:17,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:17,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:17,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:18:17,076 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:17,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:17,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1803926913, now seen corresponding path program 1 times [2025-01-09 04:18:17,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:17,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451462415] [2025-01-09 04:18:17,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:17,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:17,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:18:17,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:18:17,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:17,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:17,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:17,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451462415] [2025-01-09 04:18:17,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451462415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:17,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:17,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:17,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977053643] [2025-01-09 04:18:17,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:17,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:17,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:17,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:17,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:17,275 INFO L87 Difference]: Start difference. First operand 5440 states and 8837 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:18,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:18,556 INFO L93 Difference]: Finished difference Result 17462 states and 29148 transitions. [2025-01-09 04:18:18,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:18,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 149 [2025-01-09 04:18:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:18,640 INFO L225 Difference]: With dead ends: 17462 [2025-01-09 04:18:18,640 INFO L226 Difference]: Without dead ends: 12039 [2025-01-09 04:18:18,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:18,666 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 946 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:18,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 2331 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:18:18,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12039 states. [2025-01-09 04:18:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12039 to 11680. [2025-01-09 04:18:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11680 states, 10703 states have (on average 1.6357096141268803) internal successors, (17507), 10916 states have internal predecessors, (17507), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-01-09 04:18:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11680 states to 11680 states and 19663 transitions. [2025-01-09 04:18:19,309 INFO L78 Accepts]: Start accepts. Automaton has 11680 states and 19663 transitions. Word has length 149 [2025-01-09 04:18:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:19,310 INFO L471 AbstractCegarLoop]: Abstraction has 11680 states and 19663 transitions. [2025-01-09 04:18:19,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:19,311 INFO L276 IsEmpty]: Start isEmpty. Operand 11680 states and 19663 transitions. [2025-01-09 04:18:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:18:19,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:19,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:19,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:18:19,326 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:19,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:19,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1544002497, now seen corresponding path program 1 times [2025-01-09 04:18:19,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:19,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192695273] [2025-01-09 04:18:19,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:19,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:19,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:18:19,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:18:19,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:19,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:19,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:19,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192695273] [2025-01-09 04:18:19,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192695273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:19,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:19,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:19,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831006113] [2025-01-09 04:18:19,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:19,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:19,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:19,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:19,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:19,510 INFO L87 Difference]: Start difference. First operand 11680 states and 19663 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:20,390 INFO L93 Difference]: Finished difference Result 26528 states and 46026 transitions. [2025-01-09 04:18:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:18:20,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 149 [2025-01-09 04:18:20,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:20,497 INFO L225 Difference]: With dead ends: 26528 [2025-01-09 04:18:20,497 INFO L226 Difference]: Without dead ends: 14865 [2025-01-09 04:18:20,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:20,552 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 637 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:20,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 815 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:18:20,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14865 states. [2025-01-09 04:18:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14865 to 11680. [2025-01-09 04:18:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11680 states, 10703 states have (on average 1.6326263664393161) internal successors, (17474), 10916 states have internal predecessors, (17474), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-01-09 04:18:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11680 states to 11680 states and 19630 transitions. [2025-01-09 04:18:21,377 INFO L78 Accepts]: Start accepts. Automaton has 11680 states and 19630 transitions. Word has length 149 [2025-01-09 04:18:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:21,378 INFO L471 AbstractCegarLoop]: Abstraction has 11680 states and 19630 transitions. [2025-01-09 04:18:21,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 11680 states and 19630 transitions. [2025-01-09 04:18:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:18:21,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:21,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:21,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:18:21,396 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:21,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:21,397 INFO L85 PathProgramCache]: Analyzing trace with hash -682168895, now seen corresponding path program 1 times [2025-01-09 04:18:21,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:21,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128654571] [2025-01-09 04:18:21,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:21,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:21,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:18:21,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:18:21,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:21,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:21,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:21,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128654571] [2025-01-09 04:18:21,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128654571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:21,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:21,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:21,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109034249] [2025-01-09 04:18:21,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:21,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:21,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:21,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:21,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:21,575 INFO L87 Difference]: Start difference. First operand 11680 states and 19630 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:23,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:23,200 INFO L93 Difference]: Finished difference Result 38118 states and 66433 transitions. [2025-01-09 04:18:23,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:23,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 149 [2025-01-09 04:18:23,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:23,349 INFO L225 Difference]: With dead ends: 38118 [2025-01-09 04:18:23,349 INFO L226 Difference]: Without dead ends: 26455 [2025-01-09 04:18:23,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:23,400 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 933 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:23,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 2300 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:18:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26455 states. [2025-01-09 04:18:24,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26455 to 25942. [2025-01-09 04:18:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25942 states, 23775 states have (on average 1.6627549947423765) internal successors, (39532), 24442 states have internal predecessors, (39532), 1110 states have call successors, (1110), 390 states have call predecessors, (1110), 1056 states have return successors, (5206), 1173 states have call predecessors, (5206), 1110 states have call successors, (5206) [2025-01-09 04:18:24,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25942 states to 25942 states and 45848 transitions. [2025-01-09 04:18:24,997 INFO L78 Accepts]: Start accepts. Automaton has 25942 states and 45848 transitions. Word has length 149 [2025-01-09 04:18:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:24,997 INFO L471 AbstractCegarLoop]: Abstraction has 25942 states and 45848 transitions. [2025-01-09 04:18:24,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:24,998 INFO L276 IsEmpty]: Start isEmpty. Operand 25942 states and 45848 transitions. [2025-01-09 04:18:25,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:18:25,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:25,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:25,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:18:25,027 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:25,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1562389503, now seen corresponding path program 1 times [2025-01-09 04:18:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:25,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580139082] [2025-01-09 04:18:25,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:25,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:25,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:18:25,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:18:25,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:25,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:25,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:25,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580139082] [2025-01-09 04:18:25,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580139082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:25,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:25,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:25,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731283884] [2025-01-09 04:18:25,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:25,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:25,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:25,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:25,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:25,214 INFO L87 Difference]: Start difference. First operand 25942 states and 45848 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:28,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:28,197 INFO L93 Difference]: Finished difference Result 86324 states and 160581 transitions. [2025-01-09 04:18:28,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:28,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 149 [2025-01-09 04:18:28,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:28,497 INFO L225 Difference]: With dead ends: 86324 [2025-01-09 04:18:28,497 INFO L226 Difference]: Without dead ends: 60399 [2025-01-09 04:18:28,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:28,575 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 928 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:28,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 2288 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:18:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60399 states. [2025-01-09 04:18:31,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60399 to 59569. [2025-01-09 04:18:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59569 states, 54536 states have (on average 1.6936335631509463) internal successors, (92364), 56597 states have internal predecessors, (92364), 2198 states have call successors, (2198), 774 states have call predecessors, (2198), 2834 states have return successors, (18582), 2325 states have call predecessors, (18582), 2198 states have call successors, (18582) [2025-01-09 04:18:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59569 states to 59569 states and 113144 transitions. [2025-01-09 04:18:31,736 INFO L78 Accepts]: Start accepts. Automaton has 59569 states and 113144 transitions. Word has length 149 [2025-01-09 04:18:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:31,737 INFO L471 AbstractCegarLoop]: Abstraction has 59569 states and 113144 transitions. [2025-01-09 04:18:31,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 59569 states and 113144 transitions. [2025-01-09 04:18:31,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:18:31,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:31,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:31,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:18:31,803 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:31,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:31,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2050436609, now seen corresponding path program 1 times [2025-01-09 04:18:31,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:31,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228395950] [2025-01-09 04:18:31,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:31,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:31,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:18:31,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:18:31,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:31,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:31,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:31,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228395950] [2025-01-09 04:18:31,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228395950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:31,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:31,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:31,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509316940] [2025-01-09 04:18:31,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:31,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:31,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:31,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:31,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:31,967 INFO L87 Difference]: Start difference. First operand 59569 states and 113144 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:37,821 INFO L93 Difference]: Finished difference Result 209437 states and 423360 transitions. [2025-01-09 04:18:37,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:37,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 149 [2025-01-09 04:18:37,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:38,881 INFO L225 Difference]: With dead ends: 209437 [2025-01-09 04:18:38,881 INFO L226 Difference]: Without dead ends: 149885 [2025-01-09 04:18:39,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:39,135 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1006 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:39,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 2254 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:18:39,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149885 states. [2025-01-09 04:18:45,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149885 to 140290. [2025-01-09 04:18:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140290 states, 128195 states have (on average 1.7242170131440384) internal successors, (221036), 134502 states have internal predecessors, (221036), 4246 states have call successors, (4246), 1542 states have call predecessors, (4246), 7848 states have return successors, (69782), 4501 states have call predecessors, (69782), 4246 states have call successors, (69782) [2025-01-09 04:18:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140290 states to 140290 states and 295064 transitions. [2025-01-09 04:18:46,829 INFO L78 Accepts]: Start accepts. Automaton has 140290 states and 295064 transitions. Word has length 149 [2025-01-09 04:18:46,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:46,831 INFO L471 AbstractCegarLoop]: Abstraction has 140290 states and 295064 transitions. [2025-01-09 04:18:46,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 140290 states and 295064 transitions. [2025-01-09 04:18:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:18:46,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:46,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:46,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:18:46,953 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:46,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:46,954 INFO L85 PathProgramCache]: Analyzing trace with hash 957801407, now seen corresponding path program 1 times [2025-01-09 04:18:46,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:46,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644314941] [2025-01-09 04:18:46,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:46,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:46,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:18:46,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:18:46,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:46,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:47,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:47,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644314941] [2025-01-09 04:18:47,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644314941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:47,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:47,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:47,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259415621] [2025-01-09 04:18:47,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:47,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:47,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:47,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:47,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:47,089 INFO L87 Difference]: Start difference. First operand 140290 states and 295064 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)