./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.13.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_label49+token_ring.13.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 403fd15020889f127d837ab127be00e68706cbd07d6d3bacf6b25555a5c09975 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:28:33,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:28:33,521 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:28:33,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:28:33,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:28:33,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:28:33,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:28:33,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:28:33,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:28:33,553 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:28:33,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:28:33,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:28:33,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:28:33,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:28:33,555 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:28:33,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:28:33,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:28:33,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:28:33,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:28:33,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:28:33,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:28:33,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:28:33,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:28:33,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:28:33,557 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:28:33,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:28:33,557 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:28:33,557 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:28:33,557 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:28:33,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:28:33,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:28:33,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:28:33,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:28:33,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:28:33,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:28:33,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:28:33,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:28:33,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:28:33,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:28:33,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:28:33,559 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:28:33,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:28:33,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:28:33,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:28:33,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:28:33,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:28:33,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:28:33,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:28:33,559 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 -> 403fd15020889f127d837ab127be00e68706cbd07d6d3bacf6b25555a5c09975 [2025-01-09 05:28:33,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:28:33,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:28:33,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:28:33,839 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:28:33,840 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:28:33,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.13.cil-2.c [2025-01-09 05:28:35,143 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89b83fde1/e3ede595ddac46f9b8ce91028e16e5b3/FLAGcbb43a16e [2025-01-09 05:28:35,781 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:28:35,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.13.cil-2.c [2025-01-09 05:28:35,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89b83fde1/e3ede595ddac46f9b8ce91028e16e5b3/FLAGcbb43a16e [2025-01-09 05:28:36,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89b83fde1/e3ede595ddac46f9b8ce91028e16e5b3 [2025-01-09 05:28:36,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:28:36,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:28:36,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:28:36,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:28:36,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:28:36,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:28:36" (1/1) ... [2025-01-09 05:28:36,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce1c834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:36, skipping insertion in model container [2025-01-09 05:28:36,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:28:36" (1/1) ... [2025-01-09 05:28:36,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:28:37,881 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_label49+token_ring.13.cil-2.c[380593,380606] [2025-01-09 05:28:37,919 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_label49+token_ring.13.cil-2.c[383339,383352] [2025-01-09 05:28:38,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:28:38,322 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:28:38,945 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_label49+token_ring.13.cil-2.c[380593,380606] [2025-01-09 05:28:38,952 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_label49+token_ring.13.cil-2.c[383339,383352] [2025-01-09 05:28:38,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:28:39,056 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:28:39,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:39 WrapperNode [2025-01-09 05:28:39,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:28:39,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:28:39,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:28:39,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:28:39,065 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:28:39" (1/1) ... [2025-01-09 05:28:39,157 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:28:39" (1/1) ... [2025-01-09 05:28:39,500 INFO L138 Inliner]: procedures = 70, calls = 80, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 13242 [2025-01-09 05:28:39,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:28:39,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:28:39,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:28:39,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:28:39,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:39" (1/1) ... [2025-01-09 05:28:39,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:39" (1/1) ... [2025-01-09 05:28:39,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:39" (1/1) ... [2025-01-09 05:28:39,768 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:28:39,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:39" (1/1) ... [2025-01-09 05:28:39,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:39" (1/1) ... [2025-01-09 05:28:39,933 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:39" (1/1) ... [2025-01-09 05:28:39,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:39" (1/1) ... [2025-01-09 05:28:39,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:39" (1/1) ... [2025-01-09 05:28:40,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:39" (1/1) ... [2025-01-09 05:28:40,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:39" (1/1) ... [2025-01-09 05:28:40,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:28:40,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:28:40,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:28:40,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:28:40,121 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:39" (1/1) ... [2025-01-09 05:28:40,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:28:40,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:28:40,156 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:28:40,159 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:28:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:28:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:28:40,179 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:28:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:28:40,180 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:28:40,180 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:28:40,180 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:28:40,180 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:28:40,180 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:28:40,180 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:28:40,180 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:28:40,180 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:28:40,180 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:28:40,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:28:40,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:28:40,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:28:40,344 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:28:40,347 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:28:48,196 INFO L? ?]: Removed 1761 outVars from TransFormulas that were not future-live. [2025-01-09 05:28:48,197 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:28:48,283 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:28:48,284 INFO L312 CfgBuilder]: Removed 17 assume(true) statements. [2025-01-09 05:28:48,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:28:48 BoogieIcfgContainer [2025-01-09 05:28:48,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:28:48,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:28:48,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:28:48,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:28:48,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:28:36" (1/3) ... [2025-01-09 05:28:48,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5a4d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:28:48, skipping insertion in model container [2025-01-09 05:28:48,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:39" (2/3) ... [2025-01-09 05:28:48,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5a4d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:28:48, skipping insertion in model container [2025-01-09 05:28:48,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:28:48" (3/3) ... [2025-01-09 05:28:48,298 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.13.cil-2.c [2025-01-09 05:28:48,311 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:28:48,315 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.13.cil-2.c that has 7 procedures, 2588 locations, 1 initial locations, 17 loop locations, and 2 error locations. [2025-01-09 05:28:48,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:28:48,454 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;@c7a69b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:28:48,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:28:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 2588 states, 2553 states have (on average 1.8350959655307482) internal successors, (4685), 2555 states have internal predecessors, (4685), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 05:28:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:28:48,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:48,494 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, 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:28:48,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:48,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:48,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1325703449, now seen corresponding path program 1 times [2025-01-09 05:28:48,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:48,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256854727] [2025-01-09 05:28:48,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:48,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:48,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:28:48,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:28:48,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:48,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:49,145 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:28:49,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:49,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256854727] [2025-01-09 05:28:49,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256854727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:49,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:49,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:28:49,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002294080] [2025-01-09 05:28:49,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:49,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:28:49,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:49,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:28:49,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:28:49,192 INFO L87 Difference]: Start difference. First operand has 2588 states, 2553 states have (on average 1.8350959655307482) internal successors, (4685), 2555 states have internal predecessors, (4685), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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:28:49,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:49,426 INFO L93 Difference]: Finished difference Result 5167 states and 9461 transitions. [2025-01-09 05:28:49,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:28:49,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 187 [2025-01-09 05:28:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:49,454 INFO L225 Difference]: With dead ends: 5167 [2025-01-09 05:28:49,455 INFO L226 Difference]: Without dead ends: 2521 [2025-01-09 05:28:49,466 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:28:49,470 INFO L435 NwaCegarLoop]: 4659 mSDtfsCounter, 629 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 8681 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:28:49,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 8681 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:28:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2521 states. [2025-01-09 05:28:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2521 to 2521. [2025-01-09 05:28:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2521 states, 2486 states have (on average 1.8250201126307322) internal successors, (4537), 2488 states have internal predecessors, (4537), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 05:28:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 4591 transitions. [2025-01-09 05:28:49,648 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 4591 transitions. Word has length 187 [2025-01-09 05:28:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:49,650 INFO L471 AbstractCegarLoop]: Abstraction has 2521 states and 4591 transitions. [2025-01-09 05:28:49,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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:28:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 4591 transitions. [2025-01-09 05:28:49,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:28:49,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:49,659 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, 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:28:49,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:28:49,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:49,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:49,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1306162327, now seen corresponding path program 1 times [2025-01-09 05:28:49,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:49,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413759350] [2025-01-09 05:28:49,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:49,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:49,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:28:49,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:28:49,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:49,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:49,892 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:28:49,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:49,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413759350] [2025-01-09 05:28:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413759350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:49,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:49,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:28:49,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211402190] [2025-01-09 05:28:49,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:49,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:28:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:49,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:28:49,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:28:49,899 INFO L87 Difference]: Start difference. First operand 2521 states and 4591 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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:28:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:49,978 INFO L93 Difference]: Finished difference Result 2903 states and 5193 transitions. [2025-01-09 05:28:49,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:28:49,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 187 [2025-01-09 05:28:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:49,994 INFO L225 Difference]: With dead ends: 2903 [2025-01-09 05:28:49,994 INFO L226 Difference]: Without dead ends: 2521 [2025-01-09 05:28:49,996 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:28:49,997 INFO L435 NwaCegarLoop]: 4589 mSDtfsCounter, 615 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 8547 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:28:49,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 8547 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:28:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2521 states. [2025-01-09 05:28:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2521 to 2521. [2025-01-09 05:28:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2521 states, 2486 states have (on average 1.82461786001609) internal successors, (4536), 2488 states have internal predecessors, (4536), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 05:28:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 4590 transitions. [2025-01-09 05:28:50,085 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 4590 transitions. Word has length 187 [2025-01-09 05:28:50,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:50,087 INFO L471 AbstractCegarLoop]: Abstraction has 2521 states and 4590 transitions. [2025-01-09 05:28:50,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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:28:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 4590 transitions. [2025-01-09 05:28:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:28:50,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:50,092 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, 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:28:50,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:28:50,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:50,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:50,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1581079019, now seen corresponding path program 1 times [2025-01-09 05:28:50,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:50,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704962507] [2025-01-09 05:28:50,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:50,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:50,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:28:50,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:28:50,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:50,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:28:50,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:50,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704962507] [2025-01-09 05:28:50,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704962507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:50,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:50,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:28:50,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994283652] [2025-01-09 05:28:50,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:50,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:28:50,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:50,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:28:50,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:28:50,409 INFO L87 Difference]: Start difference. First operand 2521 states and 4590 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 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:28:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:51,286 INFO L93 Difference]: Finished difference Result 3331 states and 5890 transitions. [2025-01-09 05:28:51,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:28:51,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 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 187 [2025-01-09 05:28:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:51,304 INFO L225 Difference]: With dead ends: 3331 [2025-01-09 05:28:51,304 INFO L226 Difference]: Without dead ends: 2952 [2025-01-09 05:28:51,307 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:28:51,308 INFO L435 NwaCegarLoop]: 4448 mSDtfsCounter, 5190 mSDsluCounter, 9170 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5211 SdHoareTripleChecker+Valid, 13618 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:51,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5211 Valid, 13618 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:28:51,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2025-01-09 05:28:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 2921. [2025-01-09 05:28:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 2857 states have (on average 1.7959397969898494) internal successors, (5131), 2860 states have internal predecessors, (5131), 49 states have call successors, (49), 12 states have call predecessors, (49), 13 states have return successors, (50), 49 states have call predecessors, (50), 49 states have call successors, (50) [2025-01-09 05:28:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 5230 transitions. [2025-01-09 05:28:51,410 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 5230 transitions. Word has length 187 [2025-01-09 05:28:51,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:51,410 INFO L471 AbstractCegarLoop]: Abstraction has 2921 states and 5230 transitions. [2025-01-09 05:28:51,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 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:28:51,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 5230 transitions. [2025-01-09 05:28:51,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:28:51,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:51,413 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, 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:28:51,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:28:51,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:51,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:51,414 INFO L85 PathProgramCache]: Analyzing trace with hash -189035879, now seen corresponding path program 1 times [2025-01-09 05:28:51,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:51,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255261807] [2025-01-09 05:28:51,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:51,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:51,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:28:51,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:28:51,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:51,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:51,685 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:28:51,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:51,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255261807] [2025-01-09 05:28:51,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255261807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:51,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:51,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:51,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507994945] [2025-01-09 05:28:51,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:51,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:51,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:51,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:51,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:51,687 INFO L87 Difference]: Start difference. First operand 2921 states and 5230 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:28:52,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:52,819 INFO L93 Difference]: Finished difference Result 4214 states and 7327 transitions. [2025-01-09 05:28:52,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:52,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-01-09 05:28:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:52,838 INFO L225 Difference]: With dead ends: 4214 [2025-01-09 05:28:52,839 INFO L226 Difference]: Without dead ends: 3435 [2025-01-09 05:28:52,843 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:28:52,844 INFO L435 NwaCegarLoop]: 4786 mSDtfsCounter, 5202 mSDsluCounter, 14421 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 19207 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:52,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 19207 Invalid, 1181 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 05:28:52,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2025-01-09 05:28:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3292. [2025-01-09 05:28:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3292 states, 3199 states have (on average 1.771803688652704) internal successors, (5668), 3203 states have internal predecessors, (5668), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (75), 72 states have call predecessors, (75), 71 states have call successors, (75) [2025-01-09 05:28:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 5814 transitions. [2025-01-09 05:28:52,978 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 5814 transitions. Word has length 187 [2025-01-09 05:28:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:52,978 INFO L471 AbstractCegarLoop]: Abstraction has 3292 states and 5814 transitions. [2025-01-09 05:28:52,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:28:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 5814 transitions. [2025-01-09 05:28:52,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:28:52,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:52,984 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, 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:28:52,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:28:52,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:52,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:52,986 INFO L85 PathProgramCache]: Analyzing trace with hash 381235927, now seen corresponding path program 1 times [2025-01-09 05:28:52,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:52,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346410379] [2025-01-09 05:28:52,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:52,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:53,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:28:53,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:28:53,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:53,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:53,276 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:28:53,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:53,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346410379] [2025-01-09 05:28:53,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346410379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:53,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:53,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:53,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602049231] [2025-01-09 05:28:53,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:53,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:53,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:53,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:53,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:53,279 INFO L87 Difference]: Start difference. First operand 3292 states and 5814 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:28:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:54,425 INFO L93 Difference]: Finished difference Result 5395 states and 9214 transitions. [2025-01-09 05:28:54,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:54,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-01-09 05:28:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:54,455 INFO L225 Difference]: With dead ends: 5395 [2025-01-09 05:28:54,456 INFO L226 Difference]: Without dead ends: 4245 [2025-01-09 05:28:54,463 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:28:54,463 INFO L435 NwaCegarLoop]: 4778 mSDtfsCounter, 5194 mSDsluCounter, 14399 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5215 SdHoareTripleChecker+Valid, 19177 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:54,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5215 Valid, 19177 Invalid, 1181 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 05:28:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4245 states. [2025-01-09 05:28:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4245 to 4084. [2025-01-09 05:28:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4084 states, 3931 states have (on average 1.7387433223098447) internal successors, (6835), 3939 states have internal predecessors, (6835), 115 states have call successors, (115), 30 states have call predecessors, (115), 36 states have return successors, (131), 118 states have call predecessors, (131), 115 states have call successors, (131) [2025-01-09 05:28:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4084 states to 4084 states and 7081 transitions. [2025-01-09 05:28:54,659 INFO L78 Accepts]: Start accepts. Automaton has 4084 states and 7081 transitions. Word has length 187 [2025-01-09 05:28:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:54,659 INFO L471 AbstractCegarLoop]: Abstraction has 4084 states and 7081 transitions. [2025-01-09 05:28:54,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:28:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4084 states and 7081 transitions. [2025-01-09 05:28:54,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:28:54,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:54,667 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, 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:28:54,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:28:54,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:54,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash -404761963, now seen corresponding path program 1 times [2025-01-09 05:28:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:54,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909363828] [2025-01-09 05:28:54,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:54,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:54,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:28:54,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:28:54,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:54,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:28:54,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:54,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909363828] [2025-01-09 05:28:54,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909363828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:54,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:54,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:54,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897655604] [2025-01-09 05:28:54,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:54,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:54,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:54,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:54,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:54,923 INFO L87 Difference]: Start difference. First operand 4084 states and 7081 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:28:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:56,080 INFO L93 Difference]: Finished difference Result 7963 states and 13403 transitions. [2025-01-09 05:28:56,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:56,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-01-09 05:28:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:56,116 INFO L225 Difference]: With dead ends: 7963 [2025-01-09 05:28:56,116 INFO L226 Difference]: Without dead ends: 6021 [2025-01-09 05:28:56,127 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:28:56,129 INFO L435 NwaCegarLoop]: 4775 mSDtfsCounter, 5189 mSDsluCounter, 14390 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5210 SdHoareTripleChecker+Valid, 19165 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:56,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5210 Valid, 19165 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 05:28:56,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2025-01-09 05:28:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 5815. [2025-01-09 05:28:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5815 states, 5536 states have (on average 1.7057442196531791) internal successors, (9443), 5558 states have internal predecessors, (9443), 203 states have call successors, (203), 54 states have call predecessors, (203), 74 states have return successors, (267), 210 states have call predecessors, (267), 203 states have call successors, (267) [2025-01-09 05:28:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5815 states to 5815 states and 9913 transitions. [2025-01-09 05:28:56,415 INFO L78 Accepts]: Start accepts. Automaton has 5815 states and 9913 transitions. Word has length 187 [2025-01-09 05:28:56,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:56,417 INFO L471 AbstractCegarLoop]: Abstraction has 5815 states and 9913 transitions. [2025-01-09 05:28:56,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:28:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 5815 states and 9913 transitions. [2025-01-09 05:28:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:28:56,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:56,422 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, 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:28:56,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:28:56,423 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:56,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:56,423 INFO L85 PathProgramCache]: Analyzing trace with hash 262619927, now seen corresponding path program 1 times [2025-01-09 05:28:56,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:56,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964442033] [2025-01-09 05:28:56,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:56,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:56,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:28:56,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:28:56,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:56,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:56,662 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:28:56,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:56,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964442033] [2025-01-09 05:28:56,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964442033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:56,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:56,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:56,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952449081] [2025-01-09 05:28:56,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:56,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:56,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:56,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:56,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:56,664 INFO L87 Difference]: Start difference. First operand 5815 states and 9913 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:28:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:57,914 INFO L93 Difference]: Finished difference Result 13668 states and 22961 transitions. [2025-01-09 05:28:57,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:57,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-01-09 05:28:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:57,984 INFO L225 Difference]: With dead ends: 13668 [2025-01-09 05:28:57,984 INFO L226 Difference]: Without dead ends: 9995 [2025-01-09 05:28:57,999 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:28:58,000 INFO L435 NwaCegarLoop]: 4772 mSDtfsCounter, 5184 mSDsluCounter, 14381 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5205 SdHoareTripleChecker+Valid, 19153 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:58,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5205 Valid, 19153 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 05:28:58,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9995 states. [2025-01-09 05:28:58,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9995 to 9700. [2025-01-09 05:28:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9700 states, 9151 states have (on average 1.688012239099552) internal successors, (15447), 9219 states have internal predecessors, (15447), 379 states have call successors, (379), 102 states have call predecessors, (379), 168 states have return successors, (635), 394 states have call predecessors, (635), 379 states have call successors, (635) [2025-01-09 05:28:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9700 states to 9700 states and 16461 transitions. [2025-01-09 05:28:58,333 INFO L78 Accepts]: Start accepts. Automaton has 9700 states and 16461 transitions. Word has length 187 [2025-01-09 05:28:58,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:58,333 INFO L471 AbstractCegarLoop]: Abstraction has 9700 states and 16461 transitions. [2025-01-09 05:28:58,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:28:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 9700 states and 16461 transitions. [2025-01-09 05:28:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:28:58,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:58,340 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, 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:28:58,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:28:58,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:58,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:58,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1932608939, now seen corresponding path program 1 times [2025-01-09 05:28:58,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:58,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129152052] [2025-01-09 05:28:58,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:58,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:58,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:28:58,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:28:58,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:58,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:58,553 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:28:58,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:58,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129152052] [2025-01-09 05:28:58,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129152052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:58,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:58,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:58,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843975646] [2025-01-09 05:28:58,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:58,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:58,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:58,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:58,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:58,555 INFO L87 Difference]: Start difference. First operand 9700 states and 16461 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:28:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:59,645 INFO L93 Difference]: Finished difference Result 26711 states and 45595 transitions. [2025-01-09 05:28:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:59,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-01-09 05:28:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:59,735 INFO L225 Difference]: With dead ends: 26711 [2025-01-09 05:28:59,736 INFO L226 Difference]: Without dead ends: 19153 [2025-01-09 05:28:59,772 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:28:59,773 INFO L435 NwaCegarLoop]: 4486 mSDtfsCounter, 5219 mSDsluCounter, 13696 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5240 SdHoareTripleChecker+Valid, 18182 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:59,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5240 Valid, 18182 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:28:59,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19153 states. [2025-01-09 05:29:00,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19153 to 18685. [2025-01-09 05:29:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18685 states, 17542 states have (on average 1.6939345570630486) internal successors, (29715), 17756 states have internal predecessors, (29715), 731 states have call successors, (731), 198 states have call predecessors, (731), 410 states have return successors, (1755), 762 states have call predecessors, (1755), 731 states have call successors, (1755) [2025-01-09 05:29:00,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18685 states to 18685 states and 32201 transitions. [2025-01-09 05:29:00,515 INFO L78 Accepts]: Start accepts. Automaton has 18685 states and 32201 transitions. Word has length 187 [2025-01-09 05:29:00,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:29:00,516 INFO L471 AbstractCegarLoop]: Abstraction has 18685 states and 32201 transitions. [2025-01-09 05:29:00,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:29:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 18685 states and 32201 transitions. [2025-01-09 05:29:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:29:00,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:29:00,526 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, 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:29:00,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:29:00,526 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:29:00,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:29:00,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1587780777, now seen corresponding path program 1 times [2025-01-09 05:29:00,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:29:00,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355721844] [2025-01-09 05:29:00,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:29:00,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:29:00,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:29:00,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:29:00,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:29:00,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:29:00,690 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:29:00,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:29:00,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355721844] [2025-01-09 05:29:00,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355721844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:29:00,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:29:00,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:29:00,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208216355] [2025-01-09 05:29:00,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:29:00,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:29:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:29:00,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:29:00,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:29:00,692 INFO L87 Difference]: Start difference. First operand 18685 states and 32201 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:29:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:29:01,658 INFO L93 Difference]: Finished difference Result 40618 states and 71546 transitions. [2025-01-09 05:29:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:29:01,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-01-09 05:29:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:29:01,784 INFO L225 Difference]: With dead ends: 40618 [2025-01-09 05:29:01,784 INFO L226 Difference]: Without dead ends: 24075 [2025-01-09 05:29:01,843 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:29:01,844 INFO L435 NwaCegarLoop]: 4425 mSDtfsCounter, 4820 mSDsluCounter, 8685 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4841 SdHoareTripleChecker+Valid, 13110 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:29:01,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4841 Valid, 13110 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:29:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24075 states. [2025-01-09 05:29:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24075 to 18685. [2025-01-09 05:29:02,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18685 states, 17542 states have (on average 1.6920533576559116) internal successors, (29682), 17756 states have internal predecessors, (29682), 731 states have call successors, (731), 198 states have call predecessors, (731), 410 states have return successors, (1755), 762 states have call predecessors, (1755), 731 states have call successors, (1755) [2025-01-09 05:29:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18685 states to 18685 states and 32168 transitions. [2025-01-09 05:29:02,814 INFO L78 Accepts]: Start accepts. Automaton has 18685 states and 32168 transitions. Word has length 187 [2025-01-09 05:29:02,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:29:02,815 INFO L471 AbstractCegarLoop]: Abstraction has 18685 states and 32168 transitions. [2025-01-09 05:29:02,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:29:02,815 INFO L276 IsEmpty]: Start isEmpty. Operand 18685 states and 32168 transitions. [2025-01-09 05:29:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:29:02,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:29:02,825 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, 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:29:02,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:29:02,826 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:29:02,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:29:02,827 INFO L85 PathProgramCache]: Analyzing trace with hash -606825963, now seen corresponding path program 1 times [2025-01-09 05:29:02,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:29:02,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675470202] [2025-01-09 05:29:02,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:29:02,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:29:02,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:29:02,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:29:02,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:29:02,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:29:03,071 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:29:03,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:29:03,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675470202] [2025-01-09 05:29:03,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675470202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:29:03,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:29:03,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:29:03,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614893418] [2025-01-09 05:29:03,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:29:03,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:29:03,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:29:03,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:29:03,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:29:03,075 INFO L87 Difference]: Start difference. First operand 18685 states and 32168 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:29:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:29:04,786 INFO L93 Difference]: Finished difference Result 57204 states and 100826 transitions. [2025-01-09 05:29:04,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:29:04,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-01-09 05:29:04,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:29:04,973 INFO L225 Difference]: With dead ends: 57204 [2025-01-09 05:29:04,974 INFO L226 Difference]: Without dead ends: 40661 [2025-01-09 05:29:05,031 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:29:05,032 INFO L435 NwaCegarLoop]: 4761 mSDtfsCounter, 5166 mSDsluCounter, 14349 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5187 SdHoareTripleChecker+Valid, 19110 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:29:05,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5187 Valid, 19110 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:29:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40661 states. [2025-01-09 05:29:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40661 to 39895. [2025-01-09 05:29:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39895 states, 37402 states have (on average 1.715523234051655) internal successors, (64164), 38070 states have internal predecessors, (64164), 1435 states have call successors, (1435), 390 states have call predecessors, (1435), 1056 states have return successors, (5531), 1498 states have call predecessors, (5531), 1435 states have call successors, (5531) [2025-01-09 05:29:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39895 states to 39895 states and 71130 transitions. [2025-01-09 05:29:06,762 INFO L78 Accepts]: Start accepts. Automaton has 39895 states and 71130 transitions. Word has length 187 [2025-01-09 05:29:06,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:29:06,763 INFO L471 AbstractCegarLoop]: Abstraction has 39895 states and 71130 transitions. [2025-01-09 05:29:06,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:29:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 39895 states and 71130 transitions. [2025-01-09 05:29:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:29:06,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:29:06,780 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, 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:29:06,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:29:06,780 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:29:06,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:29:06,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1918669719, now seen corresponding path program 1 times [2025-01-09 05:29:06,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:29:06,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585129635] [2025-01-09 05:29:06,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:29:06,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:29:06,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:29:06,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:29:06,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:29:06,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:29:06,957 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:29:06,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:29:06,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585129635] [2025-01-09 05:29:06,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585129635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:29:06,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:29:06,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:29:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055111105] [2025-01-09 05:29:06,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:29:06,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:29:06,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:29:06,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:29:06,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:29:06,961 INFO L87 Difference]: Start difference. First operand 39895 states and 71130 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:29:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:29:10,027 INFO L93 Difference]: Finished difference Result 130916 states and 242530 transitions. [2025-01-09 05:29:10,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:29:10,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-01-09 05:29:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:29:10,500 INFO L225 Difference]: With dead ends: 130916 [2025-01-09 05:29:10,500 INFO L226 Difference]: Without dead ends: 93163 [2025-01-09 05:29:10,572 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:29:10,573 INFO L435 NwaCegarLoop]: 4758 mSDtfsCounter, 5161 mSDsluCounter, 14340 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5182 SdHoareTripleChecker+Valid, 19098 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:29:10,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5182 Valid, 19098 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:29:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93163 states. [2025-01-09 05:29:13,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93163 to 91792. [2025-01-09 05:29:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91792 states, 86113 states have (on average 1.7487719624214695) internal successors, (150592), 88175 states have internal predecessors, (150592), 2843 states have call successors, (2843), 774 states have call predecessors, (2843), 2834 states have return successors, (19227), 2970 states have call predecessors, (19227), 2843 states have call successors, (19227) [2025-01-09 05:29:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91792 states to 91792 states and 172662 transitions. [2025-01-09 05:29:14,107 INFO L78 Accepts]: Start accepts. Automaton has 91792 states and 172662 transitions. Word has length 187 [2025-01-09 05:29:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:29:14,109 INFO L471 AbstractCegarLoop]: Abstraction has 91792 states and 172662 transitions. [2025-01-09 05:29:14,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:29:14,109 INFO L276 IsEmpty]: Start isEmpty. Operand 91792 states and 172662 transitions. [2025-01-09 05:29:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:29:14,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:29:14,140 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, 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:29:14,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:29:14,140 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:29:14,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:29:14,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1307400661, now seen corresponding path program 1 times [2025-01-09 05:29:14,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:29:14,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058601971] [2025-01-09 05:29:14,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:29:14,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:29:14,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:29:14,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:29:14,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:29:14,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:29:14,521 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:29:14,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:29:14,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058601971] [2025-01-09 05:29:14,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058601971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:29:14,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:29:14,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:29:14,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169044444] [2025-01-09 05:29:14,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:29:14,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:29:14,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:29:14,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:29:14,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:29:14,523 INFO L87 Difference]: Start difference. First operand 91792 states and 172662 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:29:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:29:17,858 INFO L93 Difference]: Finished difference Result 220844 states and 430212 transitions. [2025-01-09 05:29:17,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:29:17,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-01-09 05:29:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:29:18,517 INFO L225 Difference]: With dead ends: 220844 [2025-01-09 05:29:18,517 INFO L226 Difference]: Without dead ends: 131194 [2025-01-09 05:29:18,926 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:29:18,927 INFO L435 NwaCegarLoop]: 4416 mSDtfsCounter, 4814 mSDsluCounter, 8668 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4835 SdHoareTripleChecker+Valid, 13084 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:29:18,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4835 Valid, 13084 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:29:18,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131194 states. [2025-01-09 05:29:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131194 to 91792. [2025-01-09 05:29:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91792 states, 86113 states have (on average 1.7472739307653897) internal successors, (150463), 88175 states have internal predecessors, (150463), 2843 states have call successors, (2843), 774 states have call predecessors, (2843), 2834 states have return successors, (19227), 2970 states have call predecessors, (19227), 2843 states have call successors, (19227) [2025-01-09 05:29:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91792 states to 91792 states and 172533 transitions. [2025-01-09 05:29:22,788 INFO L78 Accepts]: Start accepts. Automaton has 91792 states and 172533 transitions. Word has length 187 [2025-01-09 05:29:22,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:29:22,788 INFO L471 AbstractCegarLoop]: Abstraction has 91792 states and 172533 transitions. [2025-01-09 05:29:22,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:29:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 91792 states and 172533 transitions. [2025-01-09 05:29:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:29:22,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:29:22,813 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, 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:29:22,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:29:22,813 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:29:22,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:29:22,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1093232749, now seen corresponding path program 1 times [2025-01-09 05:29:22,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:29:22,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287835474] [2025-01-09 05:29:22,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:29:22,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:29:22,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:29:22,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:29:22,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:29:22,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:29:22,965 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:29:22,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:29:22,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287835474] [2025-01-09 05:29:22,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287835474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:29:22,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:29:22,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:29:22,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701277446] [2025-01-09 05:29:22,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:29:22,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:29:22,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:29:22,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:29:22,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:29:22,967 INFO L87 Difference]: Start difference. First operand 91792 states and 172533 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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)