./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.11.cil-2.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/combinations/Problem05_label46+token_ring.11.cil-2.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 c748b455b85e8e0d3f42bb7ec9994b8706853b8413212fc1d08f459460f9e58b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:24:02,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:24:02,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:24:02,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:24:02,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:24:02,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:24:02,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:24:02,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:24:02,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:24:02,943 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:24:02,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:24:02,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:24:02,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:24:02,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:24:02,944 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:24:02,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:24:02,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:24:02,944 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:24:02,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:24:02,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:24:02,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:24:02,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:24:02,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:24:02,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:24:02,945 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:24:02,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:24:02,945 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:24:02,945 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:24:02,945 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:24:02,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:24:02,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:24:02,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:24:02,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:24:02,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:24:02,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:24:02,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:24:02,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:24:02,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:24:02,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:24:02,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:24:02,946 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:24:02,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:24:02,946 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:24:02,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:24:02,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:24:02,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:24:02,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:24:02,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:24:02,947 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 -> c748b455b85e8e0d3f42bb7ec9994b8706853b8413212fc1d08f459460f9e58b [2025-01-09 05:24:03,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:24:03,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:24:03,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:24:03,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:24:03,167 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:24:03,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.11.cil-2.c [2025-01-09 05:24:04,313 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a426f473/9e93c0fff4c844baa5cfa06c2a0fc67f/FLAG502227961 [2025-01-09 05:24:04,947 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:24:04,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.11.cil-2.c [2025-01-09 05:24:04,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a426f473/9e93c0fff4c844baa5cfa06c2a0fc67f/FLAG502227961 [2025-01-09 05:24:05,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a426f473/9e93c0fff4c844baa5cfa06c2a0fc67f [2025-01-09 05:24:05,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:24:05,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:24:05,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:24:05,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:24:05,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:24:05,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:24:05" (1/1) ... [2025-01-09 05:24:05,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a2c459a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:05, skipping insertion in model container [2025-01-09 05:24:05,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:24:05" (1/1) ... [2025-01-09 05:24:05,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:24:06,430 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/combinations/Problem05_label46+token_ring.11.cil-2.c[382357,382370] [2025-01-09 05:24:06,463 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/combinations/Problem05_label46+token_ring.11.cil-2.c[383339,383352] [2025-01-09 05:24:06,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:24:06,756 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:24:07,270 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/combinations/Problem05_label46+token_ring.11.cil-2.c[382357,382370] [2025-01-09 05:24:07,273 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/combinations/Problem05_label46+token_ring.11.cil-2.c[383339,383352] [2025-01-09 05:24:07,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:24:07,339 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:24:07,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:07 WrapperNode [2025-01-09 05:24:07,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:24:07,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:24:07,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:24:07,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:24:07,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:07" (1/1) ... [2025-01-09 05:24:07,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:07" (1/1) ... [2025-01-09 05:24:07,827 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13128 [2025-01-09 05:24:07,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:24:07,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:24:07,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:24:07,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:24:07,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:07" (1/1) ... [2025-01-09 05:24:07,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:07" (1/1) ... [2025-01-09 05:24:07,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:07" (1/1) ... [2025-01-09 05:24:07,954 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 05:24:07,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:07" (1/1) ... [2025-01-09 05:24:07,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:07" (1/1) ... [2025-01-09 05:24:08,136 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:07" (1/1) ... [2025-01-09 05:24:08,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:07" (1/1) ... [2025-01-09 05:24:08,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:07" (1/1) ... [2025-01-09 05:24:08,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:07" (1/1) ... [2025-01-09 05:24:08,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:07" (1/1) ... [2025-01-09 05:24:08,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:24:08,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:24:08,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:24:08,290 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:24:08,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:07" (1/1) ... [2025-01-09 05:24:08,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:24:08,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:24:08,316 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 05:24:08,326 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 05:24:08,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:24:08,341 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:24:08,341 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:24:08,341 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:24:08,341 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:24:08,341 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:24:08,341 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:24:08,341 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:24:08,342 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:24:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:24:08,342 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:24:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:24:08,342 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:24:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:24:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:24:08,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:24:08,448 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:24:08,450 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:24:14,773 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2025-01-09 05:24:14,774 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:24:14,817 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:24:14,817 INFO L312 CfgBuilder]: Removed 15 assume(true) statements. [2025-01-09 05:24:14,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:24:14 BoogieIcfgContainer [2025-01-09 05:24:14,818 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:24:14,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:24:14,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:24:14,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:24:14,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:24:05" (1/3) ... [2025-01-09 05:24:14,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37243cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:24:14, skipping insertion in model container [2025-01-09 05:24:14,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:07" (2/3) ... [2025-01-09 05:24:14,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37243cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:24:14, skipping insertion in model container [2025-01-09 05:24:14,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:24:14" (3/3) ... [2025-01-09 05:24:14,825 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.11.cil-2.c [2025-01-09 05:24:14,836 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:24:14,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.11.cil-2.c that has 7 procedures, 2538 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-01-09 05:24:14,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:24:14,927 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;@1173feea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:24:14,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:24:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 2538 states, 2505 states have (on average 1.8383233532934131) internal successors, (4605), 2507 states have internal predecessors, (4605), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 05:24:14,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 05:24:14,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:14,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:14,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:14,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:14,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1013140036, now seen corresponding path program 1 times [2025-01-09 05:24:14,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:14,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027120566] [2025-01-09 05:24:14,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:14,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:15,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 05:24:15,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 05:24:15,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:15,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:15,348 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 05:24:15,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:15,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027120566] [2025-01-09 05:24:15,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027120566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:15,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:15,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:24:15,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327425568] [2025-01-09 05:24:15,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:15,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:24:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:15,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:24:15,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:24:15,398 INFO L87 Difference]: Start difference. First operand has 2538 states, 2505 states have (on average 1.8383233532934131) internal successors, (4605), 2507 states have internal predecessors, (4605), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 05:24:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:15,664 INFO L93 Difference]: Finished difference Result 5071 states and 9301 transitions. [2025-01-09 05:24:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:24:15,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 165 [2025-01-09 05:24:15,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:15,718 INFO L225 Difference]: With dead ends: 5071 [2025-01-09 05:24:15,719 INFO L226 Difference]: Without dead ends: 2471 [2025-01-09 05:24:15,731 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 05:24:15,733 INFO L435 NwaCegarLoop]: 4577 mSDtfsCounter, 551 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 8599 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:15,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 8599 Invalid, 2 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:24:15,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2025-01-09 05:24:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2471. [2025-01-09 05:24:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 2438 states have (on average 1.8289581624282198) internal successors, (4459), 2440 states have internal predecessors, (4459), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 05:24:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 4509 transitions. [2025-01-09 05:24:15,866 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 4509 transitions. Word has length 165 [2025-01-09 05:24:15,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:15,868 INFO L471 AbstractCegarLoop]: Abstraction has 2471 states and 4509 transitions. [2025-01-09 05:24:15,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 05:24:15,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 4509 transitions. [2025-01-09 05:24:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 05:24:15,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:15,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:15,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:24:15,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:15,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:15,877 INFO L85 PathProgramCache]: Analyzing trace with hash 668311874, now seen corresponding path program 1 times [2025-01-09 05:24:15,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:15,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690923840] [2025-01-09 05:24:15,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:15,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 05:24:15,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 05:24:15,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:15,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:16,014 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 05:24:16,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:16,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690923840] [2025-01-09 05:24:16,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690923840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:16,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:16,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:24:16,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754542586] [2025-01-09 05:24:16,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:16,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:24:16,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:16,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:24:16,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:24:16,019 INFO L87 Difference]: Start difference. First operand 2471 states and 4509 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 05:24:16,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:16,072 INFO L93 Difference]: Finished difference Result 2807 states and 5037 transitions. [2025-01-09 05:24:16,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:24:16,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 165 [2025-01-09 05:24:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:16,084 INFO L225 Difference]: With dead ends: 2807 [2025-01-09 05:24:16,084 INFO L226 Difference]: Without dead ends: 2471 [2025-01-09 05:24:16,087 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 05:24:16,088 INFO L435 NwaCegarLoop]: 4507 mSDtfsCounter, 537 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 8465 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 05:24:16,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 8465 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:24:16,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2025-01-09 05:24:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2471. [2025-01-09 05:24:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 2438 states have (on average 1.8285479901558654) internal successors, (4458), 2440 states have internal predecessors, (4458), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 05:24:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 4508 transitions. [2025-01-09 05:24:16,150 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 4508 transitions. Word has length 165 [2025-01-09 05:24:16,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:16,152 INFO L471 AbstractCegarLoop]: Abstraction has 2471 states and 4508 transitions. [2025-01-09 05:24:16,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 05:24:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 4508 transitions. [2025-01-09 05:24:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 05:24:16,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:16,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:16,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:24:16,155 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:16,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:16,155 INFO L85 PathProgramCache]: Analyzing trace with hash 282449472, now seen corresponding path program 1 times [2025-01-09 05:24:16,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:16,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665600842] [2025-01-09 05:24:16,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:16,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:16,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 05:24:16,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 05:24:16,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:16,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:16,393 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 05:24:16,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:16,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665600842] [2025-01-09 05:24:16,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665600842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:16,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:16,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:24:16,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649889314] [2025-01-09 05:24:16,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:16,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:24:16,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:16,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:24:16,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:24:16,395 INFO L87 Difference]: Start difference. First operand 2471 states and 4508 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 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 05:24:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:16,990 INFO L93 Difference]: Finished difference Result 3177 states and 5636 transitions. [2025-01-09 05:24:16,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:24:16,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 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 165 [2025-01-09 05:24:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:17,001 INFO L225 Difference]: With dead ends: 3177 [2025-01-09 05:24:17,002 INFO L226 Difference]: Without dead ends: 2846 [2025-01-09 05:24:17,003 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 05:24:17,004 INFO L435 NwaCegarLoop]: 4384 mSDtfsCounter, 5020 mSDsluCounter, 9002 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5039 SdHoareTripleChecker+Valid, 13386 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:17,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5039 Valid, 13386 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:24:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2025-01-09 05:24:17,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 2819. [2025-01-09 05:24:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2759 states have (on average 1.8017397607828924) internal successors, (4971), 2762 states have internal predecessors, (4971), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-01-09 05:24:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 5062 transitions. [2025-01-09 05:24:17,062 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 5062 transitions. Word has length 165 [2025-01-09 05:24:17,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:17,062 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 5062 transitions. [2025-01-09 05:24:17,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 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 05:24:17,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 5062 transitions. [2025-01-09 05:24:17,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 05:24:17,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:17,064 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:17,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:24:17,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:17,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:17,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1132650692, now seen corresponding path program 1 times [2025-01-09 05:24:17,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:17,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885089114] [2025-01-09 05:24:17,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:17,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:17,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 05:24:17,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 05:24:17,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:17,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:17,271 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 05:24:17,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:17,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885089114] [2025-01-09 05:24:17,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885089114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:17,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:17,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:17,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522920040] [2025-01-09 05:24:17,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:17,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:17,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:17,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:17,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:17,272 INFO L87 Difference]: Start difference. First operand 2819 states and 5062 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:18,065 INFO L93 Difference]: Finished difference Result 3944 states and 6877 transitions. [2025-01-09 05:24:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:18,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-01-09 05:24:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:18,079 INFO L225 Difference]: With dead ends: 3944 [2025-01-09 05:24:18,080 INFO L226 Difference]: Without dead ends: 3265 [2025-01-09 05:24:18,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 05:24:18,085 INFO L435 NwaCegarLoop]: 4676 mSDtfsCounter, 5028 mSDsluCounter, 14073 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5047 SdHoareTripleChecker+Valid, 18749 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:18,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5047 Valid, 18749 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:24:18,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2025-01-09 05:24:18,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3142. [2025-01-09 05:24:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3142 states, 3055 states have (on average 1.778723404255319) internal successors, (5434), 3059 states have internal predecessors, (5434), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-01-09 05:24:18,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 5568 transitions. [2025-01-09 05:24:18,172 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 5568 transitions. Word has length 165 [2025-01-09 05:24:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:18,172 INFO L471 AbstractCegarLoop]: Abstraction has 3142 states and 5568 transitions. [2025-01-09 05:24:18,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:18,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 5568 transitions. [2025-01-09 05:24:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 05:24:18,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:18,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:18,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:24:18,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:18,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:18,176 INFO L85 PathProgramCache]: Analyzing trace with hash 592221186, now seen corresponding path program 1 times [2025-01-09 05:24:18,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:18,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87410717] [2025-01-09 05:24:18,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:18,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 05:24:18,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 05:24:18,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:18,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:18,353 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 05:24:18,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:18,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87410717] [2025-01-09 05:24:18,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87410717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:18,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:18,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:18,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500620374] [2025-01-09 05:24:18,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:18,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:18,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:18,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:18,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:18,354 INFO L87 Difference]: Start difference. First operand 3142 states and 5568 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:19,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:19,043 INFO L93 Difference]: Finished difference Result 4977 states and 8522 transitions. [2025-01-09 05:24:19,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:19,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-01-09 05:24:19,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:19,061 INFO L225 Difference]: With dead ends: 4977 [2025-01-09 05:24:19,062 INFO L226 Difference]: Without dead ends: 3975 [2025-01-09 05:24:19,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 05:24:19,066 INFO L435 NwaCegarLoop]: 4672 mSDtfsCounter, 5023 mSDsluCounter, 14061 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5042 SdHoareTripleChecker+Valid, 18733 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:19,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5042 Valid, 18733 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:24:19,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2025-01-09 05:24:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 3833. [2025-01-09 05:24:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3833 states, 3690 states have (on average 1.7460704607046071) internal successors, (6443), 3698 states have internal predecessors, (6443), 105 states have call successors, (105), 30 states have call predecessors, (105), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-01-09 05:24:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 6669 transitions. [2025-01-09 05:24:19,269 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 6669 transitions. Word has length 165 [2025-01-09 05:24:19,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:19,270 INFO L471 AbstractCegarLoop]: Abstraction has 3833 states and 6669 transitions. [2025-01-09 05:24:19,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 6669 transitions. [2025-01-09 05:24:19,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 05:24:19,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:19,273 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:19,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:24:19,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:19,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:19,274 INFO L85 PathProgramCache]: Analyzing trace with hash 436240644, now seen corresponding path program 1 times [2025-01-09 05:24:19,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:19,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174204896] [2025-01-09 05:24:19,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:19,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:19,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 05:24:19,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 05:24:19,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:19,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:19,430 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 05:24:19,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:19,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174204896] [2025-01-09 05:24:19,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174204896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:19,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:19,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:19,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686389527] [2025-01-09 05:24:19,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:19,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:19,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:19,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:19,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:19,434 INFO L87 Difference]: Start difference. First operand 3833 states and 6669 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:20,183 INFO L93 Difference]: Finished difference Result 7218 states and 12165 transitions. [2025-01-09 05:24:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:20,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-01-09 05:24:20,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:20,204 INFO L225 Difference]: With dead ends: 7218 [2025-01-09 05:24:20,204 INFO L226 Difference]: Without dead ends: 5525 [2025-01-09 05:24:20,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 05:24:20,212 INFO L435 NwaCegarLoop]: 4669 mSDtfsCounter, 5018 mSDsluCounter, 14052 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5037 SdHoareTripleChecker+Valid, 18721 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:20,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5037 Valid, 18721 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:24:20,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5525 states. [2025-01-09 05:24:20,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5525 to 5344. [2025-01-09 05:24:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5344 states, 5083 states have (on average 1.7113909108794019) internal successors, (8699), 5105 states have internal predecessors, (8699), 185 states have call successors, (185), 54 states have call predecessors, (185), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-01-09 05:24:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 9133 transitions. [2025-01-09 05:24:20,342 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 9133 transitions. Word has length 165 [2025-01-09 05:24:20,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:20,342 INFO L471 AbstractCegarLoop]: Abstraction has 5344 states and 9133 transitions. [2025-01-09 05:24:20,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:20,342 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 9133 transitions. [2025-01-09 05:24:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 05:24:20,345 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:20,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:20,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:24:20,345 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:20,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:20,346 INFO L85 PathProgramCache]: Analyzing trace with hash 846851010, now seen corresponding path program 1 times [2025-01-09 05:24:20,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:20,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046903561] [2025-01-09 05:24:20,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:20,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:20,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 05:24:20,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 05:24:20,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:20,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:20,481 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 05:24:20,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:20,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046903561] [2025-01-09 05:24:20,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046903561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:20,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:20,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:20,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93565680] [2025-01-09 05:24:20,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:20,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:20,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:20,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:20,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:20,483 INFO L87 Difference]: Start difference. First operand 5344 states and 9133 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:21,236 INFO L93 Difference]: Finished difference Result 12197 states and 20487 transitions. [2025-01-09 05:24:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:21,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-01-09 05:24:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:21,274 INFO L225 Difference]: With dead ends: 12197 [2025-01-09 05:24:21,274 INFO L226 Difference]: Without dead ends: 8993 [2025-01-09 05:24:21,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 05:24:21,286 INFO L435 NwaCegarLoop]: 4666 mSDtfsCounter, 5013 mSDsluCounter, 14043 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5032 SdHoareTripleChecker+Valid, 18709 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:21,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5032 Valid, 18709 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:24:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8993 states. [2025-01-09 05:24:21,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8993 to 8735. [2025-01-09 05:24:21,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8735 states, 8220 states have (on average 1.6899026763990268) internal successors, (13891), 8288 states have internal predecessors, (13891), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-01-09 05:24:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8735 states to 8735 states and 14837 transitions. [2025-01-09 05:24:21,520 INFO L78 Accepts]: Start accepts. Automaton has 8735 states and 14837 transitions. Word has length 165 [2025-01-09 05:24:21,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:21,520 INFO L471 AbstractCegarLoop]: Abstraction has 8735 states and 14837 transitions. [2025-01-09 05:24:21,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:21,521 INFO L276 IsEmpty]: Start isEmpty. Operand 8735 states and 14837 transitions. [2025-01-09 05:24:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 05:24:21,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:21,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:21,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:24:21,525 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:21,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:21,526 INFO L85 PathProgramCache]: Analyzing trace with hash -941018812, now seen corresponding path program 1 times [2025-01-09 05:24:21,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:21,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118366090] [2025-01-09 05:24:21,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:21,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:21,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 05:24:21,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 05:24:21,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:21,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:21,655 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 05:24:21,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:21,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118366090] [2025-01-09 05:24:21,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118366090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:21,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:21,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:21,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053354715] [2025-01-09 05:24:21,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:21,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:21,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:21,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:21,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:21,656 INFO L87 Difference]: Start difference. First operand 8735 states and 14837 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:22,554 INFO L93 Difference]: Finished difference Result 23572 states and 40217 transitions. [2025-01-09 05:24:22,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:22,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-01-09 05:24:22,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:22,618 INFO L225 Difference]: With dead ends: 23572 [2025-01-09 05:24:22,618 INFO L226 Difference]: Without dead ends: 16977 [2025-01-09 05:24:22,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 05:24:22,645 INFO L435 NwaCegarLoop]: 4663 mSDtfsCounter, 5008 mSDsluCounter, 14034 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5027 SdHoareTripleChecker+Valid, 18697 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:22,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5027 Valid, 18697 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:24:22,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16977 states. [2025-01-09 05:24:23,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16977 to 16570. [2025-01-09 05:24:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16570 states, 15493 states have (on average 1.6917962951010133) internal successors, (26211), 15707 states have internal predecessors, (26211), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-01-09 05:24:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16570 states to 16570 states and 28565 transitions. [2025-01-09 05:24:23,275 INFO L78 Accepts]: Start accepts. Automaton has 16570 states and 28565 transitions. Word has length 165 [2025-01-09 05:24:23,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:23,277 INFO L471 AbstractCegarLoop]: Abstraction has 16570 states and 28565 transitions. [2025-01-09 05:24:23,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:23,277 INFO L276 IsEmpty]: Start isEmpty. Operand 16570 states and 28565 transitions. [2025-01-09 05:24:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 05:24:23,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:23,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:23,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:24:23,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:23,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1218065282, now seen corresponding path program 1 times [2025-01-09 05:24:23,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:23,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14433708] [2025-01-09 05:24:23,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:23,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:23,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 05:24:23,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 05:24:23,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:23,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:23,503 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 05:24:23,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:23,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14433708] [2025-01-09 05:24:23,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14433708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:23,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:23,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:24:23,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389292938] [2025-01-09 05:24:23,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:23,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:24:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:23,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:24:23,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:24:23,505 INFO L87 Difference]: Start difference. First operand 16570 states and 28565 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:24,194 INFO L93 Difference]: Finished difference Result 35410 states and 62318 transitions. [2025-01-09 05:24:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:24:24,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-01-09 05:24:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:24,269 INFO L225 Difference]: With dead ends: 35410 [2025-01-09 05:24:24,270 INFO L226 Difference]: Without dead ends: 20980 [2025-01-09 05:24:24,316 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 05:24:24,316 INFO L435 NwaCegarLoop]: 4361 mSDtfsCounter, 4702 mSDsluCounter, 8577 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4721 SdHoareTripleChecker+Valid, 12938 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:24,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4721 Valid, 12938 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:24:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20980 states. [2025-01-09 05:24:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20980 to 16570. [2025-01-09 05:24:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16570 states, 15493 states have (on average 1.6896663009100885) internal successors, (26178), 15707 states have internal predecessors, (26178), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-01-09 05:24:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16570 states to 16570 states and 28532 transitions. [2025-01-09 05:24:25,065 INFO L78 Accepts]: Start accepts. Automaton has 16570 states and 28532 transitions. Word has length 165 [2025-01-09 05:24:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:25,065 INFO L471 AbstractCegarLoop]: Abstraction has 16570 states and 28532 transitions. [2025-01-09 05:24:25,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 16570 states and 28532 transitions. [2025-01-09 05:24:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 05:24:25,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:25,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:25,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:24:25,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:25,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:25,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1635953984, now seen corresponding path program 1 times [2025-01-09 05:24:25,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:25,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413420406] [2025-01-09 05:24:25,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:25,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:25,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 05:24:25,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 05:24:25,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:25,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:25,228 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 05:24:25,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:25,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413420406] [2025-01-09 05:24:25,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413420406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:25,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:25,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:25,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409180960] [2025-01-09 05:24:25,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:25,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:25,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:25,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:25,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:25,230 INFO L87 Difference]: Start difference. First operand 16570 states and 28532 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:26,642 INFO L93 Difference]: Finished difference Result 49803 states and 87788 transitions. [2025-01-09 05:24:26,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:26,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-01-09 05:24:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:26,777 INFO L225 Difference]: With dead ends: 49803 [2025-01-09 05:24:26,777 INFO L226 Difference]: Without dead ends: 35373 [2025-01-09 05:24:26,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 05:24:26,819 INFO L435 NwaCegarLoop]: 4651 mSDtfsCounter, 4992 mSDsluCounter, 14001 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5011 SdHoareTripleChecker+Valid, 18652 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:26,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5011 Valid, 18652 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:24:26,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35373 states. [2025-01-09 05:24:27,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35373 to 34751. [2025-01-09 05:24:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34751 states, 32388 states have (on average 1.707607755958997) internal successors, (55306), 33056 states have internal predecessors, (55306), 1305 states have call successors, (1305), 390 states have call predecessors, (1305), 1056 states have return successors, (5401), 1368 states have call predecessors, (5401), 1305 states have call successors, (5401) [2025-01-09 05:24:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34751 states to 34751 states and 62012 transitions. [2025-01-09 05:24:27,828 INFO L78 Accepts]: Start accepts. Automaton has 34751 states and 62012 transitions. Word has length 165 [2025-01-09 05:24:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:27,831 INFO L471 AbstractCegarLoop]: Abstraction has 34751 states and 62012 transitions. [2025-01-09 05:24:27,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 34751 states and 62012 transitions. [2025-01-09 05:24:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 05:24:27,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:27,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:27,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:24:27,845 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:27,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:27,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1260059710, now seen corresponding path program 1 times [2025-01-09 05:24:27,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:27,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837148552] [2025-01-09 05:24:27,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:27,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:27,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 05:24:27,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 05:24:27,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:27,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:28,063 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 05:24:28,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:28,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837148552] [2025-01-09 05:24:28,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837148552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:28,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:28,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:28,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143781615] [2025-01-09 05:24:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:28,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:28,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:28,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:28,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:28,066 INFO L87 Difference]: Start difference. First operand 34751 states and 62012 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:30,543 INFO L93 Difference]: Finished difference Result 112356 states and 208902 transitions. [2025-01-09 05:24:30,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:30,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-01-09 05:24:30,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:31,004 INFO L225 Difference]: With dead ends: 112356 [2025-01-09 05:24:31,004 INFO L226 Difference]: Without dead ends: 79745 [2025-01-09 05:24:31,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 05:24:31,151 INFO L435 NwaCegarLoop]: 4648 mSDtfsCounter, 4987 mSDsluCounter, 13992 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5006 SdHoareTripleChecker+Valid, 18640 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:31,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5006 Valid, 18640 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:24:31,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79745 states. [2025-01-09 05:24:33,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79745 to 78646. [2025-01-09 05:24:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78646 states, 73225 states have (on average 1.7362649368385115) internal successors, (127138), 75287 states have internal predecessors, (127138), 2585 states have call successors, (2585), 774 states have call predecessors, (2585), 2834 states have return successors, (18969), 2712 states have call predecessors, (18969), 2585 states have call successors, (18969) [2025-01-09 05:24:34,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78646 states to 78646 states and 148692 transitions. [2025-01-09 05:24:34,102 INFO L78 Accepts]: Start accepts. Automaton has 78646 states and 148692 transitions. Word has length 165 [2025-01-09 05:24:34,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:34,102 INFO L471 AbstractCegarLoop]: Abstraction has 78646 states and 148692 transitions. [2025-01-09 05:24:34,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 78646 states and 148692 transitions. [2025-01-09 05:24:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 05:24:34,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:34,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:34,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:24:34,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:34,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:34,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1417467136, now seen corresponding path program 1 times [2025-01-09 05:24:34,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:34,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634592084] [2025-01-09 05:24:34,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:34,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:34,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 05:24:34,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 05:24:34,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:34,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:34,360 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 05:24:34,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:34,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634592084] [2025-01-09 05:24:34,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634592084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:34,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:34,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:34,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96485391] [2025-01-09 05:24:34,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:34,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:34,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:34,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:34,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:34,363 INFO L87 Difference]: Start difference. First operand 78646 states and 148692 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:39,420 INFO L93 Difference]: Finished difference Result 266075 states and 533148 transitions. [2025-01-09 05:24:39,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:39,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-01-09 05:24:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:40,606 INFO L225 Difference]: With dead ends: 266075 [2025-01-09 05:24:40,606 INFO L226 Difference]: Without dead ends: 189569 [2025-01-09 05:24:40,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 05:24:40,783 INFO L435 NwaCegarLoop]: 4645 mSDtfsCounter, 4982 mSDsluCounter, 13983 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5001 SdHoareTripleChecker+Valid, 18628 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:40,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5001 Valid, 18628 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:24:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189569 states. [2025-01-09 05:24:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189569 to 187577. [2025-01-09 05:24:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187577 states, 174582 states have (on average 1.7679142179606144) internal successors, (308646), 180890 states have internal predecessors, (308646), 5145 states have call successors, (5145), 1542 states have call predecessors, (5145), 7848 states have return successors, (70681), 5400 states have call predecessors, (70681), 5145 states have call successors, (70681) [2025-01-09 05:24:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187577 states to 187577 states and 384472 transitions. [2025-01-09 05:24:49,070 INFO L78 Accepts]: Start accepts. Automaton has 187577 states and 384472 transitions. Word has length 165 [2025-01-09 05:24:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:49,070 INFO L471 AbstractCegarLoop]: Abstraction has 187577 states and 384472 transitions. [2025-01-09 05:24:49,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 05:24:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 187577 states and 384472 transitions. [2025-01-09 05:24:49,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 05:24:49,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:49,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:24:49,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:24:49,122 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:49,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:49,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1780933634, now seen corresponding path program 1 times [2025-01-09 05:24:49,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:49,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224040157] [2025-01-09 05:24:49,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:49,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:49,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 05:24:49,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 05:24:49,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:49,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:49,242 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 05:24:49,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:49,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224040157] [2025-01-09 05:24:49,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224040157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:49,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:49,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:24:49,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835028504] [2025-01-09 05:24:49,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:49,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:24:49,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:49,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:24:49,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:24:49,246 INFO L87 Difference]: Start difference. First operand 187577 states and 384472 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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)